29 citations · 74 across the 56 of their papers we have counts for
5 papers · 1 filter
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…
Generalizations of the Tree Packing Conjecture
Dániel Gerbner, Balázs Keszegh, Cory Palmer
The Gyárfás tree packing conjecture asserts that any set of trees with vertices has an (edge-disjoint) packing into the complete graph on vertices. Gyárfás and Le…
Octants are Cover Decomposable
Balázs Keszegh, Dömötör Pálvölgyi
We prove that octants are cover-decomposable, i.e., any 12-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into two…