The paper studies the maximum number of edges in r-uniform hypergraphs with girth 5 and 6, denoted by exr(N, C<5) and exr(N, C<6) respectively, where N is the number of vertices and C<g denotes the family of Berge cycles of length at most g-1.
Key highlights:
The paper provides a comprehensive analysis of the connections between hypergraph Turán problems and coding theory, leading to new insights and improved bounds in both areas.
A otro idioma
del contenido fuente
arxiv.org
Ideas clave extraídas de
by Kathryn Haym... a las arxiv.org 04-03-2024
https://arxiv.org/pdf/2404.01839.pdfConsultas más profundas