7 papers
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…
On -close Sperner systems
Daniel Nagy, Balazs Patkos
For a set of positive integers, a set system is said to be -close Sperner, if for any pair of distinct sets in the skew d…
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona +8
Suppose that the vertices of a graph are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it…
t-wise Berge and t-heavy hypergraphs
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós +1
In many proofs concerning extremal parameters of Berge hypergraphs one starts with analyzing that part of that shadow graph which is contained in many hyperedges. Capturing this ph…
Triangle areas in line arrangements
Gábor Damásdi, Leonardo Martínez-Sandoval, Dániel T. Nagy +1
A widely investigated subject in combinatorial geometry, originated from Erdős, is the following. Given a point set of cardinality in the plane, how can we describe the dis…