Dániel T. Nagy

According to our database, Dániel T. Nagy authored at least 23 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The extensible No-Three-In-Line problem.

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

Eur. J. Comb., December, 2023

On graphs that contain exactly <i>k</i> copies of a subgraph, and a related problem in search theory.

Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener

Discret. Appl. Math., December, 2023

Turán problems for edge-ordered graphs.

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer

J. Comb. Theory, Ser. B, May, 2023

Query complexity of Boolean functions on the middle slice of the cube.

Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy, Kartal Nagy, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener

CoRR, 2023

2022

Rainbow Ramsey Problems for the Boolean Lattice.

Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer

Order, October, 2022

On Generalized Turán Results in Height Two Posets.

József Balogh, Ryan R. Martin, Dániel T. Nagy, Balázs Patkós

SIAM J. Discret. Math., June, 2022

Forbidden subposet problems in the grid.

Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer

Discret. Math., 2022

2021

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

Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt

SIAM J. Discret. Math., 2021

On the maximum number of copies of H in graphs with given size and order.

Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer

J. Graph Theory, 2021

On L-Close Sperner Systems.

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

Graphs Comb., 2021

Adaptive majority problems for restricted query graphs and for weighted sets.

Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener

Discret. Appl. Math., 2021

Supersaturation, Counting, and Randomness in Forbidden Subposet Problems.

Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer

Electron. J. Comb., 2021

2020

t-Wise Berge and t-Heavy Hypergraphs.

Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer

SIAM J. Discret. Math., 2020

Set systems related to a house allocation problem.

Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao

Discret. Math., 2020

Triangle areas in line arrangements.

Gábor Damásdi, Leonardo Martínez-Sandoval, Dániel T. Nagy, Zoltán Lóránt Nagy

Discret. Math., 2020

2019

Forbidding Rank-Preserving Copies of a Poset.

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer

Order, 2019

On the Number of Containments in P-free Families.

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer

Graphs Comb., 2019

Stability Results for Vertex Turán Problems in Kneser Graphs.

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer

Electron. J. Comb., 2019

2018

Forbidden subposet problems with size restrictions.

Dániel T. Nagy

J. Comb. Theory, Ser. A, 2018

2017

On the Number of 4-Edge Paths in Graphs With Given Edge Density.

Dániel T. Nagy

Comb. Probab. Comput., 2017

2015

Incomparable Copies of a Poset in the Boolean Lattice.

Gyula O. H. Katona, Dániel T. Nagy

Order, 2015

Union-Intersecting Set Systems.

Gyula O. H. Katona, Dániel T. Nagy

Graphs Comb., 2015

2013

The method of double chains for largest families with excluded subposets.

Peter Burcsi, Dániel T. Nagy

Electron. J. Graph Theory Appl., 2013