Balázs Patkós

collaborators

2 papers

math.CO2026

Chain Covers in the Boolean Lattice

ZoltÃ¡n LÃ³rÃ¡nt Nagy, BalÃ¡zs PatkÃ³s

For integers $1 \leq r \leq n + 1$ , let $N (n, r)$ denote the least number of chains in the Boolean lattice $B_{n} = 2^{[n]}$ that cover every strict $r$ -term chain. The case $r = 1$ is the clas…

math.CO2024

On a generalization of a result of Kleitman

Ryan R. Martin, BalÃ¡zs PatkÃ³s

A classical result of Kleitman determines the maximum number $f (n, s)$ of subsets in a family $F \subseteq 2^{[n]}$ of sets that do not contain distinct sets $F_1,F_2,\dots…