arXiv:2010.15519 Abstract | arXiv Analytics

Published 2020-10-29Version 1

We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.

Comments: 15 pages

Categories: math.CO

Subjects: 05C80, 05C05

Keywords: connectivity threshold, spanning trees, explicit connected spanning structure, random graph

Related articles: Most relevant | Search more

arXiv:0907.4211 [math.CO] (Published 2009-07-24)

The scaling window for a random graph with a given degree sequence

arXiv:1203.0132 [math.CO] (Published 2012-03-01)

Largest sparse subgraphs of random graphs

arXiv:1402.6466 [math.CO] (Published 2014-02-26)

Bipartite decomposition of random graphs

Noga Alon