Affiliation:
1. Department of Combinatorics and Optimization, University of Waterloo Waterloo Canada
Abstract
AbstractWe prove that the number of perfect matchings in is asymptotically normal when is even, as , and . This is the first distributional result of spanning subgraphs of when . Moreover, we prove that and can be coupled so that is a subgraph of with high probability when and . Furthermore, if , , and then and can be coupled so that asymptotically almost surely (a.a.s.) is a subgraph of .
Subject
Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software
Reference24 articles.
1. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
2. Embedding the Erdős–Rényi hypergraph into the random regular hypergraph and Hamiltonicity
3. Analytic Combinatorics
4. PuGao.Kim‐Vu's sandwich conjecture is true for alld=ωlog7n$$ d=\omega \left({\log}^7n\right) $$.arXiv preprint arXiv:2011.09449 2020.
5. PuGao.Triangles and subgraph probabilities in random regular graphs.arXiv preprint arXiv:2012.01492 2020.