On hypergraphs without loose cycles

Jie Han*, Yoshiharu Kohayakawa

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
Plum Print visual indicator of research metrics
  • Citations
    • Citation Indexes: 2
  • Captures
    • Readers: 3
see details

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).

Original languageEnglish
Pages (from-to)946-949
Number of pages4
JournalDiscrete Mathematics
Volume341
Issue number4
DOIs
Publication statusPublished - Apr 2018
Externally publishedYes

Keywords

  • Hypergraph
  • Loose cycles

Cite this

Han, J., & Kohayakawa, Y. (2018). On hypergraphs without loose cycles. Discrete Mathematics, 341(4), 946-949. https://doi.org/10.1016/j.disc.2017.12.015