1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2020★ 1 cited
Realizing an m-uniform four-chromatic hypergraph with disks
Gábor Damásdi, Pálvölgyi Dömötör
We prove that for every there is a finite point set in the plane such that no matter how is three-colored, there is always a disk containing exactly…
math.CO2019
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…