On hypergraph Tur\'an problems with bounded matching number
On hypergraph Tur\'an problems with bounded matching number
Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in $n$-vertex $F$-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.
D¨￠niel Gerbner、Casey Tompkins、Junpeng Zhou
数学
D¨￠niel Gerbner,Casey Tompkins,Junpeng Zhou.On hypergraph Tur\'an problems with bounded matching number[EB/OL].(2024-10-09)[2025-08-20].https://arxiv.org/abs/2410.07455.点此复制
评论