Canonical partitions of universal structures

DOI10.1007/S00493-006-0013-2MaRDI QIDQ858113zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 8 January 2007

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-006-0013-2

zbMATH Keywords

canonical partitionuniversal binary countable homogeneous structures

Mathematics Subject Classification ID

Partition relations (03E02) Ramsey theory (05D10)

Review text

The paper shows some results about universal binary countable homogeneous structures. In the case of infinitely many colors a result of Erdős and Rado for the integers is extended to countable universal binary homogeneous structures through the determination of the canonical set of equivalence relations.

Recommendations

• Coloring subgraphs of the Rado graph
• Ramsey theory for countable binary homogeneous structures
• scientific article; zbMATH DE number 1943973
• Binary Homogeneous Structures II
• Infinite partitions of random graphs

Cited in

(26)

• The Urysohn sphere is oscillation stable
• Big Ramsey degrees and topological dynamics
• Big Ramsey degrees of 3-uniform hypergraphs are finite
• Big Ramsey degrees in universal inverse limit structures
• Structural Ramsey theory of metric spaces and topological dynamics of isometry groups
• Canonical Vertex Partitions
• Forcing and the Halpern-Läuchli theorem
• The Ramsey theory of the universal homogeneous triangle-free graph
• Ramsey Theory on Trees and Applications
• Partition properties of the dense local order and a colored version of Milliken's theorem
• A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs
• The Ramsey theory of Henson graphs
• Carlson-Simpson's lemma and applications in reverse mathematics
• Ramsey theory of homogeneous structures: current trends and open problems
• Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
• Exact big Ramsey degrees for finitely constrained binary free amalgamation classes
• Borel sets of Rado graphs and Ramsey's theorem
• Big Ramsey degrees using parameter spaces
• Big Ramsey degrees in the metric setting (extended abstract)
• Characterisation of the big Ramsey degrees of the generic partial order
• Canonical partition theorems for parameter sets
• Infinite partitions of random graphs
• Partitions of large Rado graphs
• A partition theorem for a large dense linear order
• Coloring subgraphs of the Rado graph
• Counting canonical partitions in the random graph

This page was built for publication: Canonical partitions of universal structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858113)