3-star factors in random \(d\)-regular graphs
From MaRDI portal
Publication:850076
DOI10.1016/j.ejc.2006.05.003zbMath1103.05081OpenAlexW1977033885MaRDI QIDQ850076
Nicholas C. Wormald, Hilda Assiyatun
Publication date: 15 November 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.05.003
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Unnamed Item, THE ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF 3-STAR FACTORS IN RANDOM d-REGULAR GRAPHS, Large independent sets in random regular graphs, On the chromatic number of a random 5-regular graph
Cites Work
- The asymptotic number of labeled graphs with given degree sequences
- Almost all cubic graphs are Hamiltonian
- Almost all regular graphs are hamiltonian
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Generating and Counting Hamilton Cycles in Random Regular Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
