On hypergraphs without loose cycles

DOI10.1016/j.disc.2017.12.015zbMath1380.05142arXiv1703.10963OpenAlexW2962899044WikidataQ101496288 ScholiaQ101496288MaRDI QIDQ1699534

Jie Han, Yoshiharu Kohayakawa

Publication date: 23 February 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.10963

zbMATH Keywords

hypergraphloose cycles

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38)

Related Items (1)

The number of hypergraphs without linear cycles

Cites Work

• Unnamed Item
• The number of \(C_{2\ell}\)-free graphs
• Turán problems and shadows. I: Paths and cycles
• Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
• Intersecting families of discrete structures are typically trivial
• Hypergraph Turán numbers of linear cycles
• Counting Intersecting and Pairs of Cross-Intersecting Families
• Asymptotic enumeration, global structure, and constrained evolution

This page was built for publication: On hypergraphs without loose cycles