We show that for any fixed $α>0$, cherry-quasirandom 3-graphs of positive density and sufficiently large order $n$ with minimum vertex degree $α\binom n2$ have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and Levy.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。