4 citations · 22 across the 30 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.CO2011★ 1 cited
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…
math.CO2011
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…
math.CO2011★ 1 cited
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…