Cycle packing

DOI10.1002/rsa.20574zbMath1328.05146arXiv1310.0632OpenAlexW2914610947MaRDI QIDQ5256386

Jacob Fox, David Conlon, Benjamin Sudakov

Publication date: 22 June 2015

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

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

zbMATH Keywords

cyclesexpandersgraph decompositionsErdős-Gallai conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Monochromatic cycle partitions of graphs with large minimum degree ⋮ Path decompositions of tournaments ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Decomposing Random Graphs into Few Cycles and Edges ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ Long cycles, heavy cycles and cycle decompositions in digraphs ⋮ Path and cycle decompositions of dense graphs ⋮ Spanning Trees with Few Branch Vertices ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five

Cites Work

• Unnamed Item
• An Erdős-Gallai conjecture
• On the coverings of graphs
• Hamiltonian circuits in random graphs
• Covers of Eulerian graphs
• Subgraph coverings and edge switchings
• Covering the edges of a connected graph by paths
• Gallai's conjecture for disconnected graphs
• Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
• On maximal paths and circuits of graphs
• Probability Inequalities for Sums of Bounded Random Variables
• The Representation of a Graph by Set Intersections

This page was built for publication: Cycle packing