activity
20192026
most citedRealizing an m-uniform four-chromatic hypergraph with disks

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

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…