Dániel T. Nagy

activity

20172022

collaborators

Showing math.COShow all

15 papers · 1 filter

math.CO2022

On graphs that contain exactly k copies of a subgraph, and a related problem in search theory

Dániel Gerbner, Balázs Keszegh, Dániel Lenger +5

We study $exa_{k} (n, F)$ , the largest number of edges in an $n$ -vertex graph $G$ that contains exactly $k$ copies of a given subgraph $F$ . The case $k = 0$ is the Turán number…

math.CO2022

Triangles in intersecting families

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

We prove the following the generalized Turán type result. A collection $T$ of $r$ sets is an $r$ -triangle if for every $T_{1}, T_{2}, \dots, T_{r - 1} \in T$ we have $\ca…

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.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

On Covering Numbers, Young Diagrams, and the Local Dimension of Posets

Gábor Damásdi, Stefan Felsner, António Girão +4

We study covering numbers and local covering numbers with respect to difference graphs and complete bipartite graphs. In particular we show that in every cover of a Young diagram w…

math.CO2019

On $L$ -close Sperner systems

Daniel Nagy, Balazs Patkos

For a set $L$ of positive integers, a set system $F \subseteq 2^{[n]}$ is said to be $L$ -close Sperner, if for any pair $F, G$ of distinct sets in $F$ the skew d…