On hypergraphs without loose cycles

DOI10.1016/J.DISC.2017.12.015MaRDI QIDQ1699534zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

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

Abstract: Recently, Mubayi and Wang showed that for $rge4$ and $ellge3$, the number of $n$-vertex $r$-graphs that do not contain any loose cycle of length $ell$ is at most $2^{O(n^{r-1}(logn{)}^{(r-3)/(r-2)})}$. We improve this bound to $2^{O(n^{r-1}loglogn)}$.

Recommendations

• Hypergraphs with no tight cycles
• On tight cycles in hypergraphs
• Large hypergraphs without tight cycles
• The number of hypergraphs without linear cycles
• On 3-uniform hypergraphs without a cycle of a given length

Cites work

• Asymptotic enumeration, global structure, and constrained evolution
• Counting intersecting and pairs of cross-intersecting families
• Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
• scientific article; zbMATH DE number 3557819 (Why is no real title available?)
• Hypergraph Turán numbers of linear cycles
• Intersecting families of discrete structures are typically trivial
• The number of \(C_{2\ell}\)-free graphs
• Turán problems and shadows. I: Paths and cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699534)