29 citations · 74 across the 56 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
Proper Coloring of Geometric Hypergraphs
Balázs Keszegh, Dömötör Pálvölgyi
We study whether for a given planar family F there is an m such that any finite set of points can be 3-colored such that any member of F that contains at least m points contains tw…
math.CO2016
On the number of cycles in a graph with restricted cycle lengths
Dániel Gerbner, Balázs Keszegh, Cory Palmer +1
Let be a set of positive integers. We call a (directed) graph an \emph{-cycle graph} if all cycle lengths in belong to . Let be the maximum number of cyc…
math.CO2016
Line Percolation in Finite Projective Planes
Dániel Gerbner, Balázs Keszegh, Gábor Mészáros +2
We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolatin…