Long cycles in percolated expanders

DOI10.37236/13219MaRDI QIDQ7035575zbMATH OpenFDO

Authors Maurício Collares, Sahar Diskin, Joshua Erde, Michael Krivelevich

Publication date 29 January 2025

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

Full work available at URL https://doi.org/10.37236/13219

zbMATH Keywords

depth-first search algorithmGalton-Watson branching process

Mathematics Subject Classification ID

Paths and cycles (05C38) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorial probability (60C05)

Cites work

• Expander graphs and their applications
• Expanders -- how to find them, and what to find in them
• Expansion in supercritical random subgraphs of expanders and its consequences
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Introduction to Random Graphs
• Long cycles in locally expanding graphs, with applications
• Long cycles in random subgraphs of graphs with large minimum degree
• Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
• Minors in expanding graphs
• Norm-graphs: Variations and applications
• Random graphs.
• Regular graphs whose subgraphs tend to be acyclic
• The longest path in a random graph
• The phase transition in random graphs: a simple proof
• The probabilistic method

This page was built for publication: Long cycles in percolated expanders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7035575)