Coloring subgraphs of the Rado graph

DOI10.1007/s00493-006-0015-0zbMath1121.03052OpenAlexW2051714857MaRDI QIDQ858115

Norbert W. 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

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

Related Items

The Ramsey theory of Henson graphs ⋮ A partition theorem for a large dense linear order ⋮ Rainbow Ramsey simple structures ⋮ On big Ramsey degrees for binary free amalgamation classes ⋮ Big Ramsey degrees of 3-uniform hypergraphs are finite ⋮ FORCING AND THE HALPERN–LÄUCHLI THEOREM ⋮ Ramsey theory of homogeneous structures: current trends and open problems ⋮ Forcing with copies of the Rado and Henson graphs ⋮ THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL ⋮ Dual Ramsey properties for classes of algebras ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ Groups and dynamics: topology, measure, and Borel structure. Abstracts from the workshop held January 16--22, 2022 ⋮ The Ramsey theory of the universal homogeneous triangle-free graph ⋮ Big Ramsey degrees in universal inverse limit structures ⋮ Finite big Ramsey degrees in universal structures ⋮ Counting canonical partitions in the random graph ⋮ Ramsey degrees: big v. small ⋮ Ramsey Theory on Trees and Applications ⋮ The Urysohn sphere is oscillation stable ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma ⋮ Ramsey theory for countable binary homogeneous structures ⋮ Infinite partitions of random graphs