Long cycles in random subgraphs of graphs with large minimum degree

DOI10.1002/rsa.20571zbMath1320.05116arXiv1308.3144OpenAlexW1983089725MaRDI QIDQ5256392

Oliver Riordan

Publication date: 22 June 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graphslong cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Vertex degrees (05C07)

Related Items

Large complete minors in random subgraphs, Crux and Long Cycles in Graphs, Perfect matchings in random subgraphs of regular bipartite graphs, Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs, Long paths in heterogeneous random subgraphs of graphs with large minimum degree, The Threshold Probability for Long Cycles, On Hamilton cycles in Erdős‐Rényi subgraphs of large graphs, Paths and cycles in random subgraphs of graphs with large minimum degree

Cites Work

• Long paths and cycles in random subgraphs of graphs with large minimum degree