Decomposing Random Graphs into Few Cycles and Edges

DOI10.1017/S0963548314000844zbMath1371.05150arXiv1404.3306OpenAlexW2151710412MaRDI QIDQ5364258

Dániel Korándi, Michael Krivelevich, Benjamin Sudakov

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (5)

Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Path and cycle decompositions of dense graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Erdős-Gallai conjecture
• Hamiltonian circuits in random graphs
• Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
• Paths in graphs
• Edge-disjoint Hamilton cycles in random graphs
• Cycle packing
• The Representation of a Graph by Set Intersections
• The diameter of sparse random graphs

This page was built for publication: Decomposing Random Graphs into Few Cycles and Edges