A note on maximum size of Berge-C₄-free hypergraphs

2020/01/05 by Beka Ergemlidze, Ergemlidze, Beka
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2001.01184

openalex publication_date 2020/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we consider maximum possible value for the sum of cardinalities of hyperedges of a hypergraph without a Berge 4-cycle. We significantly improve the previous upper bound provided by Gerbner and Palmer. Furthermore, we provide a construction that slightly improves the previous lower bound.

Related

• Avoiding long Berge cycles, the missing cases k=r+1 and k = r+2
• On 3-uniform hypergraphs without a cycle of a given length
• Hypergraphs with few Berge paths of fixed length between vertices
• On the maximum size of connected hypergraphs without a path of given\n length
• Berge cycles in non-uniform hypergraphs