Infinite partitions of random graphs

DOI10.1016/J.JCTA.2005.03.002MaRDI QIDQ817599zbMATH OpenOpenAlexFDO

Authors 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

canonical partitionsRamsey theory

Mathematics Subject Classification ID

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

Review text

Ramsey theory for finite partitions (or colourings) of the \(n\)-element subsets of the set of vertices in a random graph \(G\) is extended to canonical infinite partitions.

Recommendations

• Partitions and orientations of the Rado graph
• scientific article; zbMATH DE number 3893250
• Which subsets of an infinite random graph look random?
• Canonical partitions of universal structures
• Partitioning random graphs into large cycles

Cites work

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

Cited in

(11)

• Tree-partitions of infinite graphs
• Barak-Erdős graphs and the infinite-bin model
• On classes of infinite loaded graphs with randomly deleted edges
• On representing words in the automorphism group of the random graph
• Canonical Vertex Partitions
• Infinite Paley graphs
• Which subsets of an infinite random graph look random?
• Ramsey theory for countable binary homogeneous structures
• A partition theorem for a large dense linear order
• Canonical partitions of universal structures
• Counting canonical partitions in the random graph

This page was built for publication: Infinite partitions of random graphs

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