Counting canonical partitions in the random graph

DOI10.1007/S00493-008-2148-9zbMath1212.05008DBLPjournals/combinatorica/Larson08OpenAlexW1999206300WikidataQ60691945 ScholiaQ60691945MaRDI QIDQ987546

Jean A. Larson

Publication date: 13 August 2010

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-008-2148-9

zbMATH Keywords

canonical partitionsJ-treesJoyce trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Partition relations (03E02)

Related Items (7)

The Ramsey theory of Henson graphs ⋮ Ramsey theory of homogeneous structures: current trends and open problems ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ The Ramsey theory of the universal homogeneous triangle-free graph ⋮ A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs ⋮ Ramsey theory for countable binary homogeneous structures ⋮ Infinite partitions of random graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Infinite partitions of random graphs
• Canonical partitions of universal structures
• Coloring subgraphs of the Rado graph
• A Ramsey theorem for trees
• Edge partitions of the countable triangle free homogeneous graph
• Canonical equivalence relations on \(\mathbb Q^n\)
• A proof of a partition theorem for [ℚⁿ]
• Functional Composition Patterns and Power Series Reversion
• A Combinatorial Theorem

This page was built for publication: Counting canonical partitions in the random graph