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 2021Show all

6 papers · 1 filter

math.CO2021

Containments in families with forbidden subposets

Dániel Nagy, Balázs Patkós

We consider the problem of determining the maximum number of pairs $F \subseteq F^{'}$ in a family $F \subseteq 2^{[n]}$ that avoids certain posets $P$ of height 2. We show th…

math.CO2021

On generalized Turán results in height two posets

József Balogh, Ryan R. Martin, Dániel T. Nagy +1

For given posets $P$ and $Q$ and an integer $n$ , the generalized Turán problem for posets, asks for the maximum number of copies of $Q$ in a $P$ -free subset of the $n$ -dimensional…

math.CO2021

Generalized Turán results for intersecting cliques

Dániel Gerbner, Balázs Patkós

For fixed graphs $F$ and $H$ , the generalized Turán problem asks for the maximum number $e x (n, H, F)$ of copies of $H$ that an $n$ -vertex $F$ -free graph can have. In this paper, we f…

math.CO2021

On saturation of Berge hypergraphs

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

A hypergraph $H = (V (H), E (H))$ is a Berge copy of a graph $F$ , if $V (F) \subset V (H)$ and there is a bijection $f : E (F) \to E (H)$ such that for any $e \in E (F)$ we have $e\subse…

math.CO2021

Forbidden subposet problems in the grid

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

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 po…

math.CO2021

Generalized Turán problems for complete bipartite graphs

Dániel Gerbner, Balázs Patkós

For graph $G$ , $F$ and integer $n$ , the generalized Tuán number $e x (n, G, F)$ denotes the maximum number of copies of $G$ that an $F$ -free $n$ -vertex graph can have. We study this pa…