Dániel Gerbner

activity

20112022

most citedExtremal results for Berge-hypergraphs

4 citations · 22 across the 30 of their papers we have counts for

collaborators

Showing 2020Show all

5 papers · 1 filter

math.CO2020

On Turán-good graphs

Dániel Gerbner

For graphs $H$ and $F$ , the generalized Turán number $e x (n, H, F)$ is the largest number of copies of $H$ in an $F$ -free graph on $n$ vertices. We say that $H$ is $F$ -Turán-good if $…

math.CO2020

Saturation problems with regularity constraints

Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1

For a graph $F$ , we say that another graph $G$ is $F$ -saturated, if $G$ is $F$ -free and adding any edge to $G$ would create a copy of $F$ . We study for a given graph $F$ and intege…

math.CO2020

Supersaturation, counting, and randomness in forbidden subposet problems

Dániel Gerbner, Dániel Nagy, Balázs Patkós +1

In the area of forbidden subposet problems we look for the largest possible size $L a (n, P)$ of a family $F \subseteq 2^{[n]}$ that does not contain a forbidden inclusion pa…

math.CO2020★ 2 cited

Generalized Turán problems for small graphs

Dániel Gerbner

For graphs $H$ and $F$ , the generalized Turán number $e x (n, H, F)$ is the largest number of copies of $H$ in an $F$ -free graph on $n$ vertices. We consider this problem when both $H$ …

math.CO2020★ 3 cited

Some exact results for generalized Turán problems

Dániel Gerbner, Cory Palmer

Fix a $k$ -chromatic graph $F$ . In this paper we consider the question to determine for which graphs $H$ does the Turán graph $T_{k - 1} (n)$ have the maximum number of copies of $H$ a…