Dániel T. Nagy

29 papers Journal 29
YearRankTypeTitle / Venue / Authors
2025 J jnl
An Erdős-Ko-Rado type theorem for subgraphs of perfect matchings.
Discret. Math.
Dániel T. Nagy
2025 J jnl
Query complexity of Boolean functions on the middle slice of the cube.
Discret. Appl. Math.
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
2024 J jnl
Chain-dependent Conditions in Extremal Set Theory.
Order
Dániel T. Nagy, Kartal Nagy
2024 J jnl
Stability of extremal connected hypergraphs avoiding Berge-paths.
Eur. J. Comb.
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia, Máté Vizer
2023 J jnl
On graphs that contain exactly
Discret. Appl. Math.
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
2023 J jnl
Query complexity of Boolean functions on the middle slice of the cube.
CoRR
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
2023 J jnl
The extensible No-Three-In-Line problem.
Eur. J. Comb.
Dániel T. Nagy, Zoltán Lóránt Nagy, Russ Woodroofe
2023 J jnl
Turán problems for edge-ordered graphs.
J. Comb. Theory B
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer
2022 J jnl
Forbidden subposet problems in the grid.
Discret. Math.
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2022 J jnl
On Generalized Turán Results in Height Two Posets.
SIAM J. Discret. Math.
József Balogh, Ryan R. Martin, Dániel T. Nagy, Balázs Patkós
2022 J jnl
Rainbow Ramsey Problems for the Boolean Lattice.
Order
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2021 J jnl
Adaptive majority problems for restricted query graphs and for weighted sets.
Discret. Appl. Math.
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
2021 J jnl
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.
SIAM J. Discret. Math.
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
2021 J jnl
On L-Close Sperner Systems.
Graphs Comb.
Dániel T. Nagy, Balázs Patkós
2021 J jnl
On the maximum number of copies of H in graphs with given size and order.
J. Graph Theory
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2021 J jnl
Supersaturation, Counting, and Randomness in Forbidden Subposet Problems.
Electron. J. Comb.
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2020 J jnl
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.
CoRR
Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt
2020 J jnl
Set systems related to a house allocation problem.
Discret. Math.
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao
2020 J jnl
Triangle areas in line arrangements.
Discret. Math.
Gábor Damásdi, Leonardo Martínez-Sandoval, Dániel T. Nagy, Zoltán Lóránt Nagy
2020 J jnl
t-Wise Berge and t-Heavy Hypergraphs.
SIAM J. Discret. Math.
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2019 J jnl
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets.
CoRR
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
2019 J jnl
Forbidding Rank-Preserving Copies of a Poset.
Order
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2019 J jnl
On the Number of Containments in P-free Families.
Graphs Comb.
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2019 J jnl
Stability Results for Vertex Turán Problems in Kneser Graphs.
Electron. J. Comb.
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
2018 J jnl
Forbidden subposet problems with size restrictions.
J. Comb. Theory A
Dániel T. Nagy
2017 J jnl
On the Number of 4-Edge Paths in Graphs With Given Edge Density.
Comb. Probab. Comput.
Dániel T. Nagy
2015 J jnl
Incomparable Copies of a Poset in the Boolean Lattice.
Order
Gyula O. H. Katona, Dániel T. Nagy
2015 J jnl
Union-Intersecting Set Systems.
Graphs Comb.
Gyula O. H. Katona, Dániel T. Nagy
2013 J jnl
The method of double chains for largest families with excluded subposets.
Electron. J. Graph Theory Appl.
Peter Burcsi, Dániel T. Nagy