Book free $3$-Uniform Hypergraphs
Combinatorics
2023-10-31 v2
Abstract
A -book in a hypergraph consists of Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a -book-free 3-uniform hypergraph on vertices is at most .
Keywords
Cite
@article{arxiv.2110.01184,
title = {Book free $3$-Uniform Hypergraphs},
author = {Debarun Ghosh and Ervin Győri and Judit Nagy-György and Addisu Paulos and Chuanqi Xiao and Oscar Zamora},
journal= {arXiv preprint arXiv:2110.01184},
year = {2023}
}