On Extremal Hypergraphs for Hamiltonian Cycles
Copyright policy )On Extremal Hypergraphs for Hamiltonian Cycles
We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur��n- and Dirac-type results. While the Tur��n-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely on the minimum vertex degree.
13 pages
- Freie Universität Berlin Germany
- Institut für Mathematik Germany
Computational Theory and Mathematics, FOS: Mathematics, Mathematics - Combinatorics, Geometry and Topology, Combinatorics (math.CO), 05C35, 05C45, 05D40, 05C65, Theoretical Computer Science
Computational Theory and Mathematics, FOS: Mathematics, Mathematics - Combinatorics, Geometry and Topology, Combinatorics (math.CO), 05C35, 05C45, 05D40, 05C65, Theoretical Computer Science
citations 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).31 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!