Loose Hamilton cycles in hypergraphs
Copyright policy )Loose Hamilton cycles in hypergraphs
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n/(2(k-1))+o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K��hn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash.
new version which contains minor revisions and updates
- University of Birmingham United Kingdom
- Queen Mary University of London United Kingdom
- University of London United Kingdom
- University of Birmingham
- UNIVERSITY OF LONDON United Kingdom
hypergraph regularity, Eulerian and Hamiltonian graphs, hypergraph, Hypergraphs, Hypergraph regularity, Theoretical Computer Science, Hypergraph, Hamilton cycle, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Blow-up lemma, Combinatorics (math.CO), 05C65, 05C45, Paths and cycles, blow-up Lemma
hypergraph regularity, Eulerian and Hamiltonian graphs, hypergraph, Hypergraphs, Hypergraph regularity, Theoretical Computer Science, Hypergraph, Hamilton cycle, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Blow-up lemma, Combinatorics (math.CO), 05C65, 05C45, Paths and cycles, blow-up Lemma
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).44 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!