The number of perfect matchings, and the nesting properties, of random regular graphs
From MaRDI portal
Publication:6076217
DOI10.1002/rsa.21127zbMath1525.05171arXiv2104.11850OpenAlexW4319835964MaRDI QIDQ6076217
Publication date: 23 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.11850
normal distributionrandom regular graphslinear regressionnumber of perfect matchingssandwich conjectures
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- A transition of limiting distributions of large matchings in random graphs
- 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
- Short cycles in random regular graphs
- Sandwiching random graphs: universality between random graph models
- 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
- Sandwiching random regular graphs between binomial random graphs
- Distribution of subgraphs of random regular graphs
This page was built for publication: The number of perfect matchings, and the nesting properties, of random regular graphs