Hamiltonicity in cherry-quasirandom 3-graphs

DOI10.1016/j.ejc.2021.103457zbMath1486.05277arXiv2004.12518MaRDI QIDQ2122670

Jie Han, Luyining Gan

Publication date: 7 April 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

quasirandom hypergraph; absorbing-path method

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C45: Eulerian and Hamiltonian graphs

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)