Edge partitions of the Rado graph

DOI10.1007/BF01271269zbMATH Open0881.05095WikidataQ29396507 ScholiaQ29396507MaRDI QIDQ1375697FDOQ1375697

Authors: Maurice Pouzet, Norbert Sauer 

Publication date: 11 January 1998

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theorycoloringRado graph

Mathematics Subject Classification ID

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

Cites Work

• Some partitions of three-dimensional combinatorial cubes

Cited In (15)

• The Ramsey theory of Henson graphs
• Another look at the Erdős-Hajnal-Pósa results on partitioning edges of the Rado graph
• Partitions of large Rado graphs
• Ramsey classes of topological and metric spaces
• The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma
• Partitions and orientations of the Rado graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random graph coloring and the instability
• Atoms and partial orders of infinite languages
• The Ramsey theory of the universal homogeneous triangle-free graph
• Title not available (Why is that?)
• Ramsey theory of homogeneous structures: current trends and open problems
• Edge partitions of the countable triangle free homogeneous graph
• 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)