Tight co-degree condition for the existence of loose Hamilton cycles in\n 3-graphs

2013/08/03 by Andrzej Czygrinow, Czygrinow, Andrzej, Theodore Molla +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1308.0721

openalex publication_date 2013/08/03 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28

Abstract

In 2006, K "uhn and Osthus showed that if a 3-graph H on n vertices has\nminimum co-degree at least (1/4 +o(1))n and n is even then H has a loose\nHamilton cycle. In this paper, we prove that the minimum co-degree of n/4\nsuffices. The result is tight.\n

Citations

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

Cited by

• Positive codegree thresholds for Hamilton cycles in hypergraphs

Related

• Exact supported co-degree bounds for Hamilton cycles
• Minimum degree conditions for tight Hamilton cycles
• Few hamiltonian cycles in graphs with one or two vertex degrees
• Hamiltonian cycles in k-partite graphs
• A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs