@article{4c4131a06bd64b92b7ab71a9b2a6f4f0,
title = "On hypergraphs without loose cycles",
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 = "Hypergraph, Loose cycles",
author = "Jie Han and Yoshiharu Kohayakawa",
note = "Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",
year = "2018",
month = apr,
doi = "10.1016/j.disc.2017.12.015",
language = "English",
volume = "341",
pages = "946--949",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier B.V.",
number = "4",
}