Infinite partitions of random graphs

DOI10.1016/j.jcta.2005.03.002zbMath1085.05044OpenAlexW2079397350MaRDI QIDQ817599

Vojkan Vuksanovic

Publication date: 16 March 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.03.002

zbMATH Keywords

Ramsey theorycanonical partitions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

A partition theorem for a large dense linear order ⋮ Counting canonical partitions in the random graph ⋮ Ramsey theory for countable binary homogeneous structures

Cites Work

• Canonical partitions of universal structures
• Coloring subgraphs of the Rado graph
• Counting canonical partitions in the random graph
• A Ramsey theorem for trees
• Canonical equivalence relations on \(\mathbb Q^n\)