Edge partitions of the Rado graph

DOI10.1007/BF01271269MaRDI QIDQ1375697zbMATHWikidataFDO

Authors Maurice Pouzet, Norbert Sauer

Publication date 11 January 1998

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

Ramsey theorycoloringRado graph

Mathematics Subject Classification ID

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

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

(15)

• The strength of Ramsey's theorem for pairs over trees. I: Weak König's lemma
• Atoms and partial orders of infinite languages
• Partitions of large Rado graphs
• scientific article; zbMATH DE number 1944718 (Why is no real title available?)
• scientific article; zbMATH DE number 5938867 (Why is no real title available?)
• The Ramsey theory of Henson graphs
• Partitions and orientations of the Rado graph
• Ramsey classes of topological and metric spaces
• Coloring subgraphs of the Rado graph
• Ramsey theory of homogeneous structures: current trends and open problems
• Random graph coloring and the instability
• scientific article; zbMATH DE number 1943973 (Why is no real title available?)
• The Ramsey theory of the universal homogeneous triangle-free graph
• Another look at the Erdős-Hajnal-Pósa results on partitioning edges of the Rado graph
• Edge partitions of the countable triangle free homogeneous 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)