1 citations · 1 across the 8 of their papers we have counts for
5 papers · 2 filters
Set systems related to a house allocation problem
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku +4
We are given a set of buyers, a set of houses, and for each buyer a preference list, i.e., an ordering of the houses. A house allocation is an injective mapping from $A…
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…