Balázs Patkós

activity

20112026

most citedSet systems related to a house allocation problem

6 citations · 16 across the 19 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

Saturation problems with regularity constraints

Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1

For a graph $F$ , we say that another graph $G$ is $F$ -saturated, if $G$ is $F$ -free and adding any edge to $G$ would create a copy of $F$ . We study for a given graph $F$ and intege…

math.CO2020

Supersaturation, counting, and randomness in forbidden subposet problems

Dániel Gerbner, Dániel Nagy, Balázs Patkós +1

In the area of forbidden subposet problems we look for the largest possible size $L a (n, P)$ of a family $F \subseteq 2^{[n]}$ that does not contain a forbidden inclusion pa…

math.CO2020

VC-saturated set systems

Nóra Frankl, Sergei Kiselev, Andrey Kupavskii +1

The well-known Sauer lemma states that a family $F \subseteq 2^{[n]}$ of VC-dimension at most $d$ has size at most $\sum_{i = 0}^{d} (i n)$ . We obtain both random and ex…