| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777555 | Journal of Combinatorial Theory, Series A | 2017 | 71 Pages |
Abstract
Secondly, we find (asymptotically) the minimum codegree requirement for a k-uniform k-partite hypergraph, each of whose parts has n vertices, to contain a tight cycle of length αkn, for each 0<α<1.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft,