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

partitioncoloringuniversal binary countable homogeneous structure

Mathematics Subject Classification ID

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

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

(27)

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