Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs

zbMath1300.05284arXiv1303.1066MaRDI QIDQ405113

Wojciech Samotij, Michael Krivelevich

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsforbidden subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items

Large complete minors in random subgraphs ⋮ Crux and Long Cycles in Graphs ⋮ On the Probability that a Random Subgraph Contains a Circuit ⋮ Expansion in supercritical random subgraphs of the hypercube and its consequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle lengths in sparse graphs
• The longest path in a random graph
• Cycles of even length in graphs
• The phase transition in random graphs: A simple proof
• Graph Theory and Probability
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• Long paths and cycles in random subgraphs of graphs with large minimum degree
• Long cycles in random subgraphs of graphs with large minimum degree
• On the Non-Planarity of a Random Subgraph
• Random Graphs
• On a graph theorem by dirac