Dániel Gerbner

activity

20242026

collaborators

Showing 2024Show all

3 papers · 1 filter

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 $n$ -vertex $F$ -free graphs with bounded matching number, respectively. We consider the analogous…

math.CO2024

Generalized TurÃ¡n results for matchings

DÃ¡niel Gerbner

Given graphs $H$ and $F$ , the generalized TurÃ¡n number $ex (n, H, F)$ is the largest number of copies of $H$ in $n$ -vertex $F$ -free graphs. We study the case when either $H$ …