Hypergraphs of girth 5 and 6 and coding theory
CoRR(2024)
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
ex_r ( N, 𝒞_More
Translated text
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined