On hypergraph Tur\'an problems with bounded matching number
Combinatorics
2024-10-11 v1
Abstract
Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in -vertex -free graphs with bounded matching number, respectively. We consider the analogous Tur\'{a}n problems on hypergraphs with bounded matching number, and we obtain some exact results.
Keywords
Cite
@article{arxiv.2410.07455,
title = {On hypergraph Tur\'an problems with bounded matching number},
author = {Dániel Gerbner and Casey Tompkins and Junpeng Zhou},
journal= {arXiv preprint arXiv:2410.07455},
year = {2024}
}