Showing 2024Show all
2 papers · 1 filter
math.CO2024
On hypergraph Turán problems with bounded matching number
Dániel Gerbner, Casey Tompkins, Junpeng Zhou
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…
math.CO2024
Connected Turán numbers for Berge paths in hypergraphs
Lin-Peng Zhang, Hajo Broersma, Ervin Győri +2
Let be a family of -uniform hypergraphs. Denote by $\ex^{\mathrm{conn}}_r(n,\mathcal{F})$ the maximum number of hyperedges in an -vertex connected -uniform h…