Finding any given 2-factor in sparse pseudorandom graphs efficiently

Jie Han 0002, Yoshiharu Kohayakawa, Patrick Morris 0001, Yury Person. Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, 96(1):87-108, 2021. [doi]

@article{HanKMP21,
  title = {Finding any given 2-factor in sparse pseudorandom graphs efficiently},
  author = {Jie Han 0002 and Yoshiharu Kohayakawa and Patrick Morris 0001 and Yury Person},
  year = {2021},
  doi = {10.1002/jgt.22576},
  url = {https://doi.org/10.1002/jgt.22576},
  researchr = {https://researchr.org/publication/HanKMP21},
  cites = {0},
  citedby = {0},
  journal = {Journal of Graph Theory},
  volume = {96},
  number = {1},
  pages = {87-108},
}