Distribution of the number of spanning regular subgraphs in random graphs

DOI10.1002/rsa.20418zbMath1273.05202OpenAlexW2016223700MaRDI QIDQ2856578

Pu Gao

Publication date: 29 October 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20418

zbMATH Keywords

method of momentslog-normal distributionswitching method\(d\)-factors

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Probability distributions: general theory (60E05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Triangles and subgraph probabilities in random regular graphs

Cites Work

• Unnamed Item
• When are small subgraphs of a random graph normally distributed?
• On factors in random graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Hamiltonian circuits in random graphs
• Asymptotic normality determined by high moments, and submap counts of random maps
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• Orthogonal decompositions and functional limit theorems for random graph statistics
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Distribution of subgraphs of random regular graphs