Hamiltonicity in Cherry-quasirandom 3-graphs

preprint2020arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Hamiltonicity in Cherry-quasirandom 3-graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0