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 2022 · math.COShow all

4 papers · 2 filters

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

The extensible No-Three-In-Line problem

Dániel T. Nagy, Zoltán Lóránt Nagy, Russ Woodroofe

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n \times n$ grid while avoiding a collinear triple. The maximum is well known…

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

Chain-dependent Conditions in Extremal Set Theory

Dániel T. Nagy, Kartal Nagy

In extremal set theory our usual goal is to find the maximal size of a family of subsets of an $n$ -element set satisfying a condition. A condition is called chain-dependent, if it…