Spanning Trees at the Connectivity Threshold

DOI10.1137/20M1380521zbMath1493.05170arXiv2010.15519OpenAlexW3095274540WikidataQ114141811 ScholiaQ114141811MaRDI QIDQ5093583

Yahav Alon, Michael Krivelevich, Peleg Michaeli

Publication date: 28 July 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

connectivityspanning treerandom graph

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Hamiltonian circuits in random graphs
• Spanning trees in random graphs
• Discrepancies of spanning trees and Hamilton cycles
• Introduction to Random Graphs
• Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs
• Sharp threshold for the appearance of certain spanning trees in random graphs
• On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
• The Evolution of Random Graphs
• On the trace of random walks on random graphs
• Long paths and Hamiltonicity in random graphs
• The threshold for combs in random graphs

This page was built for publication: Spanning Trees at the Connectivity Threshold