Name
Title | ||
|---|---|---|
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph. |
Abstract | ||
|---|---|---|
We prove that any 3-uniform hypergraph whose minimum vertex degree is at least 59+o(1)n2 admits an almost-spanning tight cycle, that is, a tight cycle leaving o(n) vertices uncovered. The bound on the vertex degree is asymptotically best possible. Our proof uses the hypergraph regularity method, and in particular a recent version of the hypergraph regularity lemma proved by Allen, Böttcher, Cooley and Mycroft. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.disc.2016.12.015 | Discrete Mathematics |
Keywords | Field | DocType |
Hamilton cycle,Hypergraph,Vertex degree | Discrete mathematics,Combinatorics,Vertex (geometry),Hypergraph,Degree (graph theory),Mathematics,Lemma (mathematics) | Journal |
Volume | Issue | ISSN |
340 | 6 | 0012-365X |
Citations | PageRank | References |
1 | 0.37 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oliver Cooley | 1 | 39 | 9.15 |
| Richard Mycroft | 2 | 74 | 9.33 |