On $3$-uniform hypergraphs avoiding a cycle of length four
Combinatorics
2020-08-27 v1
Abstract
In this note we show that the maximum number of edges in a -uniform hypergraph without a Berge cycle of length four is at most . This improves earlier estimates by Gy\H{o}ri and Lemons and by F\"uredi and \"Ozkahya.
Keywords
Cite
@article{arxiv.2008.11372,
title = {On $3$-uniform hypergraphs avoiding a cycle of length four},
author = {Beka Ergemlidze and Ervin Győri and Abhishek Methuku and Nika Salia and Casey Tompkins},
journal= {arXiv preprint arXiv:2008.11372},
year = {2020}
}