17 citations · 30 across the 22 of their papers we have counts for
4 papers · 1 filter
Stability of extremal connected hypergraphs avoiding Berge-paths
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós +2
A Berge-path of length in a hypergraph is a sequence of distinct vertices and hyperedges with , f…
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 of a family that does not contain a forbidden inclusion pa…
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets
Gábor Damásdi, Stefan Felsner, António Girão +4
We study covering numbers and local covering numbers with respect to difference graphs and complete bipartite graphs. In particular we show that in every cover of a Young diagram w…
Turán problems for Edge-ordered graphs
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +3
In this paper we initiate a systematic study of the Turán problem for edge-ordered graphs. A simple graph is called , if its edges are linearly ordered. An i…