Showing 2024 · math.COShow all
3 papers · 2 filters
math.CO2024
On Turán-type problems and the abstract chromatic number
Dániel Gerbner, Hilal Hama Karim, Gaurav Kucheriya
In 2020, Coregliano and Razborov introduced a general framework to study limits of combinatorial objects, using logic and model theory. They introduced the abstract chromatic numbe…
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
Generalized Turán results for matchings
Dániel Gerbner
Given graphs and , the generalized Turán number is the largest number of copies of in -vertex -free graphs. We study the case when either …