Dániel T. Nagy

activity

20162024

most citedIdentification of a monotone Boolean function with

k

"reasons" as a combinatorial search problem

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing 2021 · math.COShow all

3 papers · 2 filters

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

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…