Coloring subgraphs of the Rado graph

DOI10.1007/S00493-006-0015-0MaRDI QIDQ858115zbMATH OpenOpenAlexFDO

Authors Norbert Sauer

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-0015-0

zbMATH Keywords

coloringpartitionuniversal binary countable homogeneous structure

Mathematics Subject Classification ID

Partition relations (03E02) Other combinatorial set theory (03E05)

Review text

Some partition properties of universal binary countable homogeneous structure are shown. In particular, the partition of the induced \(n\)-element substructures of a universal binary countable homogeneous structure \(U\) is explicitly given.

Recommendations

• scientific article; zbMATH DE number 1943973
• Universality in graph properties with degree restrictions
• Canonical partitions of universal structures
• Edge partitions of the Rado graph
• Universal \(H\)-colourable graphs

Cited in

(30)

• The Urysohn sphere is oscillation stable
• Edge partitions of the countable triangle free homogeneous graph
• Finite big Ramsey degrees in universal structures
• Ramsey degrees: big v. small
• On big Ramsey degrees for binary free amalgamation classes
• Rainbow Ramsey simple structures
• Big Ramsey degrees of 3-uniform hypergraphs are finite
• Groups and dynamics: topology, measure, and Borel structure. Abstracts from the workshop held January 16--22, 2022
• Big Ramsey degrees in universal inverse limit structures
• scientific article; zbMATH DE number 1943973 (Why is no real title available?)
• The Halpern-Läuchli theorem at a measurable cardinal
• The strength of Ramsey's theorem for pairs over trees. I: Weak König's lemma
• Forcing and the Halpern-Läuchli theorem
• The Ramsey theory of the universal homogeneous triangle-free graph
• Ramsey Theory on Trees and Applications
• The Ramsey theory of Henson graphs
• Another look at the Erdős-Hajnal-Pósa results on partitioning edges of the Rado graph
• Ramsey theory of homogeneous structures: current trends and open problems
• Forcing with copies of the Rado and Henson graphs
• Dual Ramsey properties for classes of algebras
• Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
• Big Ramsey degrees of 3-uniform hypergraphs
• 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
• Ramsey theory for countable binary homogeneous structures
• Infinite partitions of random graphs
• A partition theorem for a large dense linear order
• Canonical partitions of universal structures
• Counting canonical partitions in the random graph

This page was built for publication: Coloring subgraphs of the Rado graph

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