Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs

Abstract: In 2006, K"{u}hn and Osthus showed that if a 3-graph H on n vertices has minimum co-degree at least (1/4 +o(1))n and n is even then H has a loose Hamilton cycle. In this paper, we prove that the minimum co-degree of n/4 suffices. The result is tight.

Recommendations

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
On the Hamiltonicity of triple systems with high minimum degree
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
Families of triples with high minimum degree are Hamiltonian
Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
scientific article; zbMATH DE number 5763200

Cited in

(31)

Hamilton -cycles in randomly perturbed hypergraphs
Forcing large tight components in 3-graphs
Hamilton cycles in hypergraphs below the Dirac threshold
Minimum degree thresholds for Hamilton $(k/2)$-cycles in $k$-uniform hypergraphs
Hamiltonian paths and cycles in some 4-uniform hypergraphs
Minimum codegree threshold for Hamilton $\ell$-cycles in $k$-uniform hypergraphs
Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
Tight co-degree condition for packing of loose cycles in 3-graphs
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
The largest minimum codegree of a 3-graph without a generalized 4-cycle
scientific article; zbMATH DE number 7448677 (Why is no real title available?)
Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs
Forbidding Hamilton cycles in uniform hypergraphs
Minimum codegree threshold for $C_6^3$-factors in 3-uniform hypergraphs
Counting Hamilton cycles in Dirac hypergraphs
On powers of tight Hamilton cycles in randomly perturbed hypergraphs
Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
Transference for loose Hamilton cycles in random 3-uniform hypergraphs
Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs
A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs
Transversal Hamilton cycle in hypergraph systems
Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
Dirac's theorem for linear hypergraphs
Minimum degree conditions for Hamilton l-cycles in k-uniform hypergraphs
Spanning Euler tours in hypergraphs
Hamiltonicity in randomly perturbed hypergraphs
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree

This page was built for publication: Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979823)