Loose Hamiltonian cycles forced by large (k− 2)-degree - sharp version
Copyright policy )Loose Hamiltonian cycles forced by large (k− 2)-degree - sharp version
We prove for all k\geq 4 and 1\leq \ell <k/2 the sharp minimum (k-2)-degree bound for a k-uniform hypergraph H on n vertices to contain a Hamiltonian \ell-cycle if k-\ell divides n and n is sufficiently large. This extends a result of Han and Zhao for 3-uniform hypegraphs.
- Universidade de São Paulo Brazil
- UNIVERSIDADE DE SAO PAULO Brazil
- Universidade Federal do Ceará Brazil
- Universidade Federal do ABC Brazil
- Universität Hamburg Germany
Eulerian and Hamiltonian graphs, hypergraphs, 05C65 (primary), 05C45 (secondary), degree conditions, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Hypergraphs, Hypergraphs; Hamiltonian cycles; Degree conditions, Hamiltonian cycles
Eulerian and Hamiltonian graphs, hypergraphs, 05C65 (primary), 05C45 (secondary), degree conditions, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Hypergraphs, Hypergraphs; Hamiltonian cycles; Degree conditions, Hamiltonian cycles
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).2 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.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!