Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs

Elad Aigner-Horev, Gil Levy. Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs. Combinatorics, Probability & Computing, 30(3):412-443, 2021. [doi]

@article{Aigner-HorevL21,
  title = {Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs},
  author = {Elad Aigner-Horev and Gil Levy},
  year = {2021},
  doi = {10.1017/S0963548320000486},
  url = {https://doi.org/10.1017/S0963548320000486},
  researchr = {https://researchr.org/publication/Aigner-HorevL21},
  cites = {0},
  citedby = {0},
  journal = {Combinatorics, Probability & Computing},
  volume = {30},
  number = {3},
  pages = {412-443},
}