Hamiltonicity in Cherry-quasirandom 3-graphs

Luyining Gan; Jie Han

doi:10.1016/j.ejc.2021.103457

Hamiltonicity in Cherry-quasirandom 3-graphs

Luyining Gan, Jie Han

School of Mathematics and Statistics

University of Nevada, Reno

Research output: Contribution to journal › Article › peer-review

Abstract

We show that for any fixed α>0, cherry-quasirandom 3-graphs of positive density and sufficiently large order n with minimum vertex degree [Formula presented] have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and Levy.

Original language	English
Article number	103457
Journal	European Journal of Combinatorics
Volume	102
DOIs	https://doi.org/10.1016/j.ejc.2021.103457
Publication status	Published - May 2022

Access to Document

10.1016/j.ejc.2021.103457

Cite this

@article{1f882b2caf2e4b62aed4486efd02154c,

title = "Hamiltonicity in Cherry-quasirandom 3-graphs",

abstract = "We show that for any fixed α>0, cherry-quasirandom 3-graphs of positive density and sufficiently large order n with minimum vertex degree [Formula presented] have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and Levy.",

author = "Luyining Gan and Jie Han",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier Ltd",

year = "2022",

month = may,

doi = "10.1016/j.ejc.2021.103457",

language = "English",

volume = "102",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

}

TY - JOUR

T1 - Hamiltonicity in Cherry-quasirandom 3-graphs

AU - Gan, Luyining

AU - Han, Jie

PY - 2022/5

Y1 - 2022/5

N2 - We show that for any fixed α>0, cherry-quasirandom 3-graphs of positive density and sufficiently large order n with minimum vertex degree [Formula presented] have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and Levy.

AB - We show that for any fixed α>0, cherry-quasirandom 3-graphs of positive density and sufficiently large order n with minimum vertex degree [Formula presented] have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and Levy.

UR - http://www.scopus.com/inward/record.url?scp=85119047974&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2021.103457

DO - 10.1016/j.ejc.2021.103457

M3 - Article

AN - SCOPUS:85119047974

SN - 0195-6698

VL - 102

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

M1 - 103457

ER -

Hamiltonicity in Cherry-quasirandom 3-graphs

Abstract

Access to Document

Other files and links

Cite this