74 citations · 102 across the 28 of their papers we have counts for
5 papers · 2 filters
Irregular Labellings of Circulant Graphs
Marcin Anholcer
We investigate the \textit{irregularity strength} () and \textit{total vertex irregularity strength} () of circulant graphs and prove that $tvs(Ci_n…
Two-part set systems
Dániel Gerbner, Péter L. Erdős, Nathan Lemons +3
The two part Sperner theorem of Katona and Kleitman states that if is an -element set with partition , and $\cF$ is a family of subsets of such that no two…
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…
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…
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…