705 research outputs found
The random graph
Erd\H{o}s and R\'{e}nyi showed the paradoxical result that there is a unique
(and highly symmetric) countably infinite random graph. This graph, and its
automorphism group, form the subject of the present survey.Comment: Revised chapter for new edition of book "The Mathematics of Paul
Erd\H{o}s
Ramsey precompact expansions of homogeneous directed graphs
In 2005, Kechris, Pestov and Todorcevic provided a powerful tool to compute
an invariant of topological groups known as the universal minimal flow,
immediately leading to an explicit representation of this invariant in many
concrete cases. More recently, the framework was generalized allowing for
further applications, and the purpose of this paper is to apply these new
methods in the context of homogeneous directed graphs.
In this paper, we show that the age of any homogeneous directed graph allows
a Ramsey precompact expansion. Moreover, we verify the relative expansion
properties and consequently describe the respective universal minimal flows
Binary simple homogeneous structures are supersimple with finite rank
Suppose that M is an infinite structure with finite relational vocabulary
such that every relation symbol has arity at most 2. If M is simple and
homogeneous then its complete theory is supersimple with finite SU-rank which
cannot exceed the number of complete 2-types over the empty set
Fraisse Limits, Ramsey Theory, and Topological Dynamics of Automorphism Groups
We study in this paper some connections between the Fraisse theory of
amalgamation classes and ultrahomogeneous structures, Ramsey theory, and
topological dynamics of automorphism groups of countable structures.Comment: 73 pages, LaTeX 2e, to appear in Geom. Funct. Ana
- …