4 citations · 22 across the 30 of their papers we have counts for
8 papers · 1 filter
Rainbow copies of in families of
Dániel Gerbner
We study the following problem. How many distinct copies of can an -vertex graph have, if does not contain a rainbow , that is, a copy of where each edge is c…
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
Dániel Gerbner, Balázs Keszegh, Dániel Lenger +5
We study , the largest number of edges in an -vertex graph that contains exactly copies of a given subgraph . The case is the Turán number…
On the extremal graphs in generalized Turán problems
Dániel Gerbner
Given two graphs and , the generalized Turán number is the largest number of copies of in an -vertex -free graph. For every and sufficient…
Some exact results for non-degenerate generalized Turán problems
Dániel Gerbner
The generalized Turán number is the maximum number of copies of in -vertex -free graphs. We consider the case where . There are several ex…
Paths are Turán-good
Dániel Gerbner
We show that among -free -vertex graphs, the Turán graph contains the most copies of any path.
Some stability and exact results in generalized Turán problems
Dániel Gerbner
Given graphs and , the generalized Turán number is the largest number of copies of in -vertex -free graphs. Stability refers to the usual phen…