Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821849439, 9780821882375

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Methods for algorithmic meta theorems

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11051 ◽

2011 ◽

pp. 181-205 ◽

Cited By ~ 18

Author(s):

Martin Grohe ◽

Stephan Kreutzer

Download Full-text

(Un)countable and (non)effective versions of Ramsey’s theorem

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11057 ◽

2011 ◽

pp. 467-487 ◽

Cited By ~ 1

Author(s):

Dietrich Kuske

Keyword(s):

Ramsey's Theorem ◽

Ramsey’S Theorem

Download Full-text

Compton’s method for proving logical limit laws

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11049 ◽

2011 ◽

pp. 97-128

Author(s):

Jason Bell ◽

Stanley Burris

Keyword(s):

Limit Laws

Download Full-text

Counting homomorphisms and partition functions

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11053 ◽

2011 ◽

pp. 243-291 ◽

Cited By ~ 7

Author(s):

Martin Grohe ◽

Marc Thurley

Keyword(s):

Partition Functions

Download Full-text

Spectra and systems of equations

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11048 ◽

2011 ◽

pp. 43-96

Author(s):

Jason Bell ◽

Stanley Burris ◽

Karen Yeats

Keyword(s):

Systems Of Equations

Download Full-text

Some examples of universal and generic partial orders

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11054 ◽

2011 ◽

pp. 293-317 ◽

Cited By ~ 2

Author(s):

Jan Hubička ◽

Jarošlav Nešetřil

Keyword(s):

Partial Orders

Download Full-text

Partitions and permutation groups

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11060 ◽

2011 ◽

pp. 453-466

Author(s):

Andreas Blass

Keyword(s):

Permutation Groups

Download Full-text

Logical complexity of graphs: A survey

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11050 ◽

2011 ◽

pp. 129-179 ◽

Cited By ~ 4

Author(s):

Oleg Pikhurko ◽

Oleg Verbitsky

Download Full-text

On symmetric indivisbility of countable structures

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11056 ◽

2011 ◽

pp. 417-452 ◽

Cited By ~ 1

Author(s):

Assaf Hasson ◽

Menachem Kojman ◽

Alf Onshuus

Download Full-text

On counting generalized colorings

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics ◽

10.1090/conm/558/11052 ◽

2011 ◽

pp. 207-241 ◽

Cited By ~ 4

Author(s):

Tomer Kotek ◽

Johann Makowsky ◽

Boris Zilber

Download Full-text

Contemporary Mathematics - Model Theoretic Methods in Finite CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

Methods for algorithmic meta theorems

(Un)countable and (non)effective versions of Ramsey’s theorem

Compton’s method for proving logical limit laws

Counting homomorphisms and partition functions

Spectra and systems of equations

Some examples of universal and generic partial orders

Partitions and permutation groups

Logical complexity of graphs: A survey

On symmetric indivisbility of countable structures

On counting generalized colorings

Contemporary Mathematics - Model Theoretic Methods in Finite Combinatorics
Latest Publications