Counting canonical partitions in the random graph

DOI10.1007/S00493-008-2148-9MaRDI QIDQ987546zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4081578
• scientific article; zbMATH DE number 4008409
• Infinite partitions of random graphs
• Counting contours on trees
• Subset counting in trees

Cites work

• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• A Combinatorial Theorem
• A Ramsey theorem for trees
• A proof of a partition theorem for [ℚ]ⁿ
• Canonical equivalence relations on \(\mathbb Q^n\)
• Canonical partitions of universal structures
• Coloring subgraphs of the Rado graph
• Edge partitions of the countable triangle free homogeneous graph
• Functional Composition Patterns and Power Series Reversion
• Infinite partitions of random graphs

Cited in

(8)

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

Describes a project that uses

Uses Software

• OEIS

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

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