Decomposing Random Graphs into Few Cycles and Edges

Dániel Korándi, Michael Krivelevich, Benny Sudakov. Decomposing Random Graphs into Few Cycles and Edges. Combinatorics, Probability & Computing, 24(6):857-872, 2015. [doi]

@article{KorandiKS15,
  title = {Decomposing Random Graphs into Few Cycles and Edges},
  author = {Dániel Korándi and Michael Krivelevich and Benny Sudakov},
  year = {2015},
  doi = {10.1017/S0963548314000844},
  url = {http://dx.doi.org/10.1017/S0963548314000844},
  researchr = {https://researchr.org/publication/KorandiKS15},
  cites = {0},
  citedby = {0},
  journal = {Combinatorics, Probability & Computing},
  volume = {24},
  number = {6},
  pages = {857-872},
}