Cycle Factors and Renewal Theory
From MaRDI portal
Publication:2958190
DOI10.1002/cpa.21613zbMath1354.05074arXiv1401.2707OpenAlexW2962717211MaRDI QIDQ2958190
Eyal Lubetzky, Nicholas C. Wormald, Jeffry Kahn
Publication date: 1 February 2017
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2707
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Renewal theory (60K05)
Related Items
Spanning structures and universality in sparse hypergraphs, The threshold for combs in random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding nearly-spanning bounded degree trees
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- The asymptotic distribution of short cycles in random regular graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The longest path in a random graph
- The asymptotic number of labeled graphs with given degree sequences
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Large bounded degree trees in expanding graphs
- Embedding Spanning Trees in Random Graphs
- Factors in random graphs
- Random Trees in Random Graphs
- Almost all cubic graphs are Hamiltonian
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Generating and Counting Hamilton Cycles in Random Regular Graphs
- Probability Inequalities for Sums of Bounded Random Variables
- On the existence of a factor of degree one of a connected random graph
- The threshold for combs in random graphs
- A property of power series with positive coefficients
