A transition of limiting distributions of large matchings in random graphs

DOI10.1016/j.jctb.2015.07.001zbMath1327.05303arXiv1305.5009OpenAlexW1658178599MaRDI QIDQ895995

Pu Gao, Cristiane M. Sato

Publication date: 11 December 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

distributionrandom graphsmatchings

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

The number of perfect matchings, and the nesting properties, of random regular graphs, Triangles and subgraph probabilities in random regular graphs, Bivariate fluctuations for the number of arithmetic progressions in random sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced subgraphs in sparse random graphs with given degree sequences
• When are small subgraphs of a random graph normally distributed?
• The asymptotic distribution of short cycles in random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Matchings in random biregular bipartite graphs
• Weighted enumeration of spanning subgraphs in locally tree-like graphs
• Uniform generation of random regular graphs of moderate degree
• 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
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Distributions of Sparse Spanning Subgraphs in Random Graphs