Balázs Patkós

works on

boolean lattice 1 extremal set theory 1 forbidden subposet 1 middle layers 1 poset-free families 1

From the 1 of 3 linked papers with an AI index.

collaborators

3 papers

math.CO2026

Crown-free families and forbidden subposets with $e (P) \in {1, 2}$

Balázs Patkós, Casey Tompkins

The maximum size of a weak $P$ -free family $F \subseteq 2^{[n]}$ is denoted by $L a (n, P)$ . Let $e (P)$ denote the maximum integer $k$ such that the union of any $k$ consecut…

math.CO2026

On the maximum size of $B_{3}$ -free and $D_{s}$ -free families

BalÃ¡zs PatkÃ³s, Balázs Patkós

The paper proves that for the Boolean poset B₃, the largest weak or strong B₃‑free family of subsets of [n] is at least (3 + ε) times the middle binomial coefficient, establishing…

math.CO2026

Anti-Ramsey forbidden poset problems

BalÃ¡zs PatkÃ³s

A family $G$ of sets is a weak copy of a poset $P$ if there is a bijection $f : P \to G$ such that $p ⩽ q$ implies $f (p) \subseteq f (q)$ . If $f$ sati…

Crown-free families and forbidden subposets with e(P)∈{1,2}

On the maximum size of B3​-free and Ds​-free families

Anti-Ramsey forbidden poset problems

Crown-free families and forbidden subposets with $e (P) \in {1, 2}$

On the maximum size of $B_{3}$ -free and $D_{s}$ -free families