Projects per year
Abstract
We prove that any $3$uniform hypergraph whose minimum vertex degree is at least $\left(\frac{5}{9} + o(1) \right)\binom{n}{2}$ admits an almostspanning tight cycle, that is, a tight cycle leaving $o(n)$ vertices uncovered. The bound on the vertex degree is asymptotically best possible. Our proof uses the hypergraph regularity method, and in particular a recent version of the hypergraph regularity lemma proved by Allen, B\"ottcher, Cooley and Mycroft.
Original language  English 

Pages (fromto)  11721179 
Number of pages  8 
Journal  Discrete Mathematics 
Volume  340 
Issue number  6 
Early online date  20 Mar 2017 
DOIs  
Publication status  Published  Jun 2017 
Keywords
 Hamilton cycle
 Hypergraph
 Vertex degree
Fingerprint
Dive into the research topics of 'The minimum vertex degree for an almostspanning tight cycle in a 3uniform hypergraph'. Together they form a unique fingerprint.Projects
 1 Finished

Embeddings in hypergraphs
Engineering & Physical Science Research Council
30/03/15 → 29/03/17
Project: Research Councils