Counting canonical partitions in the random graph
From MaRDI portal
Publication:987546
DOI10.1007/S00493-008-2148-9zbMATH Open1212.05008DBLPjournals/combinatorica/Larson08OpenAlexW1999206300WikidataQ60691945 ScholiaQ60691945MaRDI QIDQ987546FDOQ987546
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
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Partition relations (03E02)
Cites Work
- Title not available (Why is that?)
- Functional Composition Patterns and Power Series Reversion
- A Combinatorial Theorem
- A Ramsey theorem for trees
- Canonical partitions of universal structures
- Edge partitions of the countable triangle free homogeneous graph
- Canonical equivalence relations on \(\mathbb Q^n\)
- A proof of a partition theorem for [ℚ]ⁿ
- Infinite partitions of random graphs
- Coloring subgraphs of the Rado graph
Cited In (8)
- The Ramsey theory of Henson graphs
- A recurrence for counting graphical partitions
- A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
- The Ramsey theory of the universal homogeneous triangle-free graph
- Ramsey theory of homogeneous structures: current trends and open problems
- Ramsey theory for countable binary homogeneous structures
- Infinite partitions of random graphs
Uses Software
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)
