Name
Abstract | ||
|---|---|---|
For 1 < k / 2 , we show that for sufficiently large n, every k-uniform hypergraph on n vertices with minimum codegree at least n 2 ( k - ) contains a Hamilton -cycle. This codegree condition is best possible and improves on work of Hí n and Schacht who proved an asymptotic result. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jcta.2015.01.004 | Journal of Combinatorial Theory Series A |
Keywords | Field | DocType |
hamilton cycle | Discrete mathematics,Combinatorics,Vertex (geometry),Hamiltonian path,Constraint graph,Hypergraph,Mathematics | Journal |
Volume | Issue | ISSN |
132 | C | 0097-3165 |
Citations | PageRank | References |
6 | 0.53 | 13 |
Authors | ||
2 | ||