Edge partitions of the Rado graph

DOI10.1007/BF01271269MaRDI QIDQ1375697zbMATH OpenWikidataFDO

Authors Maurice Pouzet, Norbert Sauer

Publication date 11 January 1998

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01271269

zbMATH Keywords

coloringRado graphRamsey theory

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Generalized Ramsey theory (05C55)

Review text

The Rado graph \(\mathcal R\) is the unique countable graph with the mapping extension property. It is known that coloring the edge set of \(\mathcal R\) by a finite number of colors there need not be a one-colored copy of \(\mathcal R\) in the resulting graph. The authors show that a two-colored copy of \(\mathcal R\) will appear.

Recommendations

• Partitions of large Rado graphs
• Another look at the Erdős-Hajnal-Pósa results on partitioning edges of the Rado graph
• scientific article; zbMATH DE number 5938867

Cites work

• Some partitions of three-dimensional combinatorial cubes

Cited in

(17)

• Edge partitions of the countable triangle free homogeneous graph
• Ramsey classes of topological and metric spaces
• Partitions and orientations of the Rado graph
• Atoms and partial orders of infinite languages
• scientific article; zbMATH DE number 1944718 (Why is no real title available?)
• scientific article; zbMATH DE number 1943973 (Why is no real title available?)
• 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 5938867 (Why is no real title available?)
• 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
• Random graph coloring and the instability
• Exact big Ramsey degrees for finitely constrained binary free amalgamation classes
• Borel sets of Rado graphs and Ramsey's theorem
• Partitions of large Rado graphs
• Coloring subgraphs of the Rado graph

This page was built for publication: Edge partitions of the Rado graph

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