6 citations · 16 across the 19 of their papers we have counts for
4 papers · 1 filter
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…
Singular Turán numbers and WORM-colorings
Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1
A subgraph of is \textit{singular} if the vertices of either have the same degree in or have pairwise distinct degrees in . The largest number of edges of a grap…
On the general position problem on Kneser graphs
Balázs Patkós
In a graph , a geodesic between two vertices and is a shortest path connecting to . A subset of the vertices of is in general position if no vertex of …
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…