Random 4-regular graphs have 3-star decompositions asymptotically almost surely

DOI10.1016/j.ejc.2018.04.008zbMath1390.05215arXiv1610.01113OpenAlexW2964072617WikidataQ129779510 ScholiaQ129779510MaRDI QIDQ1645062

Luke Postle, Michelle Delcourt

Publication date: 28 June 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.01113

zbMATH Keywords

\(S_3\)-decompositionrandom 4-regular graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A proof of the Barát-Thomassen conjecture
• Modular Orientations of Random and Quasi-Random Regular Graphs
• From the theory of regular graphs of third and fourth degree
• Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
• Growing Protean Graphs
• Almost all cubic graphs are Hamiltonian
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• On the Number of Perfect Matchings in Random Lifts
• Claw‐decompositions and tutte‐orientations
• On the algebraic theory of graph colorings
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Random 4-regular graphs have 3-star decompositions asymptotically almost surely