Hypergraphs of girth 5 and 6 and coding theory

2024/04/02 by Kathryn Haymaker, Haymaker, Kathryn, Michael Tait +3
Engineering · #05C35 #05C65 #11H71 #94B65 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2404.01839

openalex publication_date 2024/04/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we study the maximum number of edges in an N-vertex r-uniform hypergraph with girth g where g ∈ \5,6 \. Writing \textrmex_r ( N, C_

Related

• Counting Hypergraphs with Large Girth
• On regular hypergraphs of high girth
• Avoiding long Berge cycles II, exact bounds for all n
• On the number of linear uniform hypergraphs with linear girth constraint
• On an Extremal Hypergraph Problem Related to Combinatorial Batch Codes