An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph
From MaRDI portal
Publication:5300499
DOI10.1137/090766279zbMath1267.05153arXiv0907.3511MaRDI QIDQ5300499
Graeme Kemkes, Nicholas C. Wormald
Publication date: 27 June 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.3511
Related Items
Longest Paths in Random Hypergraphs, Cycle lengths in sparse random graphs, Heavy and light paths and Hamilton cycles, On the performance of the depth first search algorithm in supercritical random graphs, Loose cores and cycles in random hypergraphs, The longest cycle problem is polynomial on interval graphs, Asymptotic enumeration of strongly connected digraphs by vertices and edges