no code implementations • 16 Feb 2021 • Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
For posets $P$ and $Q$, extremal and saturation problems about weak and strong $P$-free subposets of $Q$ have been studied mostly in the case $Q$ is the Boolean poset $Q_n$, the poset of all subsets of an $n$-element set ordered by inclusion.
Combinatorics
no code implementations • 20 Jan 2021 • Dániel Gerbner, Balázs Patkós
For graph $G$, $F$ and integer $n$, the generalized Tu\'an number $ex(n, G, F)$ denotes the maximum number of copies of $G$ that an $F$-free $n$-vertex graph can have.
Combinatorics
no code implementations • 1 Aug 2016 • Dániel Gerbner, Balázs Keszegh, Gábor Mészáros, Balázs Patkós, Máté Vizer
We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes.
Combinatorics
