On hypergraphs without loose cycles

2017/03/31 by Jie Han, Han, Jie, Yoshiharu Kohayakawa +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1703.10963

6 pages

arxiv created 2017/03/31 · arxiv updated 2017/04/03

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 2^O( n^r-1 (log n)^(r-3)/(r-2)). We improve this bound to 2^O( n^r-1 log log n) .

Related

• Counting r-graphs without forbidden configurations
• Hypergraphs with no tight cycles
• On 2-connected hypergraphs with no long cycles
• On the number of linear hypergraphs of large girth
• On 3-uniform hypergraphs without a cycle of a given length