| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903031 | Discrete Mathematics | 2018 | 4 Pages |
Abstract
Recently, Mubayi and Wang showed that for râ¥4 and ââ¥3, the number of n-vertex r-graphs that do not contain any loose cycle of length â is at most 2O(nrâ1(logn)(râ3)â(râ2)). We improve this bound to 2O(nrâ1loglogn).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jie Han, Yoshiharu Kohayakawa,