Partitions of large Rado graphs

DOI10.1007/S00153-009-0138-2zbMATH Open1174.03020OpenAlexW1990349180MaRDI QIDQ834717FDOQ834717

Authors: Jean A. Larson, William J. Mitchell, Mirna Džamonja 

Publication date: 27 August 2009

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://ueaeprints.uea.ac.uk/id/eprint/19969/1/radopre.pdf

Recommendations

• Partitions and orientations of the Rado graph
• Edge partitions of the Rado graph
• Partitions of Graphs
• scientific article; zbMATH DE number 3867385
• On partition graphs
• Partitions of graphs into small and large sets
• Generalized partitions of graphs
• Another look at the Erdős-Hajnal-Pósa results on partitioning edges of the Rado graph
• On partitioning of hypergraphs
• scientific article; zbMATH DE number 637295

zbMATH Keywords

random graphRado graphCohen forcinggeneralized Ramsey theorypartitions of graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75) Partition relations (03E02) Ramsey theory (05D10)

Cites Work

• Canonical partitions of universal structures
• Ramsey theory for countable binary homogeneous structures

Cited In (11)

• The Ramsey theory of Henson graphs
• A partition theorem for a large dense linear order
• The Halpern-Läuchli theorem at a measurable cardinal
• Forcing and the Halpern-Läuchli theorem
• Ramsey Theory on Trees and Applications
• Factorizing the Rado graph and infinite complete graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

This page was built for publication: Partitions of large Rado graphs

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