74 citations · 178 across the 85 of their papers we have counts for
104 papers
Rainbow Turán problems for a matching and any other graph
Dániel Gerbner, Shujing Miao
For a family of graphs $\cF$, a graph is called $\cF$-free if it does not contain any member of $\cF$ as a subgraph. Given a collection of graphs on the same ver…
Uniquely -saturated graphs
Yuying Li, Kexiang Xu, Dániel Gerbner +1
A graph is uniquely -saturated if it contains no copy of a graph as a subgraph, but adding any new edge into creates exactly one copy of . Let be the…
A note on vertex Turán problems in the Kneser cube
Dániel Gerbner, Balázs Patkós
The Kneser cube has vertex set and two vertices are joined by an edge if and only if . For a fixed graph , we are interested in the m…
Directed graphs without rainbow stars
Daniel Gerbner, Andrzej Grzesik, Cory Palmer +1
In a rainbow version of the classical Turán problem one considers multiple graphs on a common vertex set, thinking of each graph as edges in a distinct color, and wants to determin…
Degree powers and number of stars in graphs with a forbidden broom
Dániel Gerbner
Given a graph with degree sequence and a positive integer , let . We denote by the largest value of …
On degree powers and counting stars in -free graphs
Dániel Gerbner
Given a positive integer and a graph with degree sequence , we define . We let be the largest value of $e_r(G…