3 citations · 6 across the 4 of their papers we have counts for
4 papers
Saturating Sperner families
Dániel Gerbner, Balázs Keszegh, Nathan Lemons +3
A family $\cF \subseteq 2^{[n]}$ saturates the monotone decreasing property $\cP$ if $\cF$ satisfies $\cP$ and one cannot add any set to $\cF$ such that property $\cP$ is still sat…
Coloring half-planes and bottomless rectangles
Balázs Keszegh
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of th…
Path-search in the pyramid and in other graphs
Dániel Gerbner, Balázs Keszegh
We are given an acyclic directed graph with one source, and a subset of its edges which contains exactly one outgoing edge for every non-sink vertex. These edges determine a unique…
Drawing planar graphs of bounded degree with few slopes
Balázs Keszegh, János Pach, Dömötör Pálvölgyi
We settle a problem of Dujmović, Eppstein, Suderman, and Wood by showing that there exists a function with the property that every planar graph with maximum degree admi…