@article{AH2000,
  author = {Aharoni, Ron and Haxell, Penny},
  title = {{Hall}'s theorem for hypergraphs},
  journal = {Journal of Graph Theory},
  volume = {35},
  number = {2},
  year = {2000},
  pages = {83--88},
  doi = {10.1002/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V},
  url = {https://doi.org/10.1002/1097-0118(200010)35:2%3C83::AID-JGT2%3E3.0.CO;2-V}
}

@article{BM2024,
  author = {Buci\'c, Matija and Montgomery, Richard},
  title = {Towards the {Erd\H{o}s--Gallai} cycle decomposition conjecture},
  journal = {Advances in Mathematics},
  volume = {437},
  year = {2024},
  pages = {109434},
  doi = {10.1016/j.aim.2023.109434},
  eprint = {2211.07689},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url = {https://arxiv.org/abs/2211.07689v2},
  note = {Theorem numbering refers to arXiv:2211.07689v2, 14 November 2023}
}

@article{CFS2014,
  author = {Conlon, David and Fox, Jacob and Sudakov, Benny},
  title = {Cycle packing},
  journal = {Random Structures \& Algorithms},
  volume = {45},
  number = {4},
  year = {2014},
  pages = {608--626},
  doi = {10.1002/rsa.20574},
  eprint = {1310.0632},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url = {https://people.math.ethz.ch/~sudakovb/cycle-packing.pdf}
}

@article{EGP1966,
  author = {Erd\H{o}s, Paul and Goodman, A. W. and P\'osa, Louis},
  title = {The representation of a graph by set intersections},
  journal = {Canadian Journal of Mathematics},
  volume = {18},
  year = {1966},
  pages = {106--112},
  doi = {10.4153/CJM-1966-014-3},
  url = {https://www.renyi.hu/~p_erdos/1966-21.pdf}
}

@incollection{Lovasz1968,
  author = {Lov\'asz, L\'aszl\'o},
  title = {On covering of graphs},
  booktitle = {Theory of Graphs (Proceedings of the Colloquium, Tihany, 1966)},
  editor = {Erd\H{o}s, P. and Katona, G.},
  publisher = {Academic Press; Akad\'emiai Kiad\'o},
  address = {New York--London; Budapest},
  year = {1968},
  pages = {231--236},
  url = {https://www.researchgate.net/profile/Laszlo-Lovasz/publication/268652766_On_covering_of_graphs/links/5e1465b7299bf10bc3967731/On-covering-of-graphs.pdf}
}

@article{Krivelevich2019,
  author = {Krivelevich, Michael},
  title = {Long cycles in locally expanding graphs, with applications},
  journal = {Combinatorica},
  volume = {39},
  number = {1},
  year = {2019},
  pages = {135--151},
  doi = {10.1007/s00493-017-3701-1},
  eprint = {1609.06851},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url = {https://www.math.tau.ac.il/~krivelev/long_cycles_expanders.pdf}
}

@article{BKS2012,
  author = {Ben-Eliezer, Ido and Krivelevich, Michael and Sudakov, Benny},
  title = {Long cycles in subgraphs of (pseudo)random directed graphs},
  journal = {Journal of Graph Theory},
  volume = {70},
  number = {3},
  year = {2012},
  pages = {284--296},
  doi = {10.1002/jgt.20616},
  eprint = {1009.3721},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url = {https://arxiv.org/abs/1009.3721}
}

@article{Pyber1985,
  author = {Pyber, L\'aszl\'o},
  title = {An {Erd\H{o}s--Gallai} conjecture},
  journal = {Combinatorica},
  volume = {5},
  number = {1},
  year = {1985},
  pages = {67--79},
  doi = {10.1007/BF02579444},
  url = {https://doi.org/10.1007/BF02579444}
}

@article{KKS2015,
  author = {Kor{\'a}ndi, D{\'a}niel and Krivelevich, Michael and Sudakov, Benny},
  title = {Decomposing random graphs into few cycles and edges},
  journal = {Combinatorics, Probability and Computing},
  volume = {24}, number = {6}, year = {2015}, pages = {857--872},
  doi = {10.1017/S0963548314000844},
  url = {https://people.math.ethz.ch/~sudakovb/cycle-packing-random-graphs.pdf}
}
@article{GGKO2021,
  author = {Gir{\~a}o, Ant{\'o}nio and Granet, Bertille and K{\"u}hn, Daniela and Osthus, Deryk},
  title = {Path and cycle decompositions of dense graphs},
  journal = {Journal of the London Mathematical Society},
  volume = {104}, number = {3}, year = {2021}, pages = {1085--1134},
  doi = {10.1112/jlms.12455},
  url = {https://web.mat.bham.ac.uk/D.Osthus/path_cycle_dec_dense.pdf}
}

@misc{AABC2025,
  author = {Akbari, Saieed and Aloni, Jonny and Beikmohammadi, Arash and Clow, Alexander},
  title = {Tight Bounds for Cycle-Edge Decompositions and Covers},
  year = {2025},
  eprint = {2509.01901},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url = {https://arxiv.org/abs/2509.01901v2},
  note = {arXiv:2509.01901v2, 7 September 2025}
}