29 citations · 74 across the 56 of their papers we have counts for
6 papers · 1 filter
Coloring points with respect to squares
Eyal Ackerman, Balázs Keszegh, Máté Vizer
We consider the problem of -coloring geometric hypergraphs. Specifically, we show that there is a constant such that any finite set of points in the plane $\mathcal{S} \subs…
Finding a non-minority ball with majority answers
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi +3
Suppose we are given a set of balls each colored either red or blue in some way unknown to us. To find out some information about the colors, we can query…
On the size of planarly connected crossing graphs
Eyal Ackerman, Balázs Keszegh, Mate Vizer
We prove that if an -vertex graph can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoi…
On the number of edge-disjoint triangles in -free graphs
Ervin Győri, Balázs Keszegh
We show the quarter of a century old conjecture that every -free graph with vertices and edges contains pairwise edge disjoint triangles.
More on Decomposing Coverings by Octants
Balázs Keszegh, Dömötör Pálvölgyi
In this note we improve our upper bound given earlier by showing that every 9-fold covering of a point set in the space by finitely many translates of an octant decomposes into two…
Choosability and paintability of the lexicographic product of graphs
Balázs Keszegh, Xuding Zhu
This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if has maximum degree , then for any graph on vertices $c…