2 citations · 4 across the 5 of their papers we have counts for
5 papers
Separating families of convex sets
D. Gerbner, G. Tóth
Two elements, and , are separated by a set if it contains exactly one of and . We prove that any set of points in general position in the plane can be separat…
2-Colored Matchings in a 3-Colored K^{3}_{12}
Neal Bushaw, Peter Csorba, Lindsay Erickson +5
Let denote the complete -uniform hypergraph on vertices. A matching in a hypergraph is a set of pairwise vertex disjoint edges. Recent Ramsey-type results re…
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…
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…
Cross-Sperner families
Dániel Gerbner, Nathan Lemons, Cory Palmer +2
A pair of families $(\cF,\cG)$ is said to be \emph{cross-Sperner} if there exists no pair of sets $F \in \cF, G \in \cG$ with or . There are two ways…