Balázs Patkós

activity

20112026

most citedInduced and non-induced poset saturation problems

29 citations · 72 across the 26 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020

Stability of extremal connected hypergraphs avoiding Berge-paths

Dániel Gerbner, Dániel T. Nagy, Balázs Patkós +2

A Berge-path of length $k$ in a hypergraph $H$ is a sequence $v_{1}, e_{1}, v_{2}, e_{2}, \dots, v_{k}, e_{k}, v_{k + 1}$ of distinct vertices and hyperedges with $v_{i}, v_{i + 1} \in e_{i}$ , f…

math.CO2020★ 29 cited

Induced and non-induced poset saturation problems

Balázs Keszegh, Nathan Lemons, Ryan R. Martin +2

A subfamily $G \subseteq F \subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $F$ if there exists a bijection $i:P\rightarrow \ma…