Artículos con órdenes de acceso público - Dániel T. NagyMás información
Disponibles en algún lugar: 24
Squares and their centers
T Keleti, DT Nagy, P Shmerkin
Journal d'Analyse Mathématique 134, 643–669, 2018
Órdenes: Hungarian Scientific Research Fund, National Office for Research …
Turán problems for edge-ordered graphs
D Gerbner, A Methuku, DT Nagy, D Pálvölgyi, G Tardos, M Vizer
Journal of Combinatorial Theory, Series B 160, 66-113, 2023
Órdenes: Magyar Tudományos Akadémia, UK Engineering and Physical Sciences Research …
On the number of 4-edge paths in graphs with given edge density
DT Nagy
Combinatorics, Probability & Computing 26 (3), 431-447, 2017
Órdenes: National Office for Research, Development and Innovation, Hungary
Rainbow Ramsey Problems for the Boolean Lattice
FH Chang, D Gerbner, WT Li, A Methuku, DT Nagy, B Patkós, M Vizer
Order 39, 453–463, 2022
Órdenes: Magyar Tudományos Akadémia, UK Engineering and Physical Sciences Research …
On the maximum number of copies of H in graphs with given size and order
D Gerbner, DT Nagy, B Patkós, M Vizer
Journal of Graph Theory 96 (1), 34-43, 2021
Órdenes: Magyar Tudományos Akadémia, National Office for Research, Development and …
On the number of containments in P-free families
D Gerbner, A Methuku, DT Nagy, B Patkós, M Vizer
Graphs and Combinatorics 35 (6), 1519–1540, 2019
Órdenes: Magyar Tudományos Akadémia, National Office for Research, Development and …
Stability of extremal connected hypergraphs avoiding Berge-paths
D Gerbner, DT Nagy, B Patkós, N Salia, M Vizer
European Journal of Combinatorics 118, 103930, 2024
Órdenes: Magyar Tudományos Akadémia, National Office for Research, Development and …
Edge ordered Turán problems
D Gerbner, A Methuku, DT Nagy, D Pálvölgyi, G Tardos, M Vizer
Acta Mathematica Universitatis Comenianae 88 (3), 717-722, 2019
Órdenes: Magyar Tudományos Akadémia, National Office for Research, Development and …
Forbidden subposet problems with size restrictions
DT Nagy
J. Combinatorial Theory, Ser. A 155, 42-66., 2018
Órdenes: National Office for Research, Development and Innovation, Hungary
Vertex Turán problems for the oriented hypercube
D Gerbner, A Methuku, DT Nagy, B Patkós, M Vizer
Acta Universitatis Sapientiae, Mathematica 13 (2), 356-366, 2021
Órdenes: Magyar Tudományos Akadémia, UK Engineering and Physical Sciences Research …
Set systems related to a house allocation problem
D Gerbner, B Keszegh, A Methuku, DT Nagy, B Patkós, C Tompkins, ...
Discrete Mathematics 343 (7), 111886, 2020
Órdenes: Magyar Tudományos Akadémia, National Office for Research, Development and …
Forbidding rank-preserving copies of a poset
D Gerbner, A Methuku, DT Nagy, B Patkós, M Vizer
Order 36 (3), 611–620, 2019
Órdenes: Magyar Tudományos Akadémia, National Office for Research, Development and …
The extensible No-Three-In-Line problem
DT Nagy, ZL Nagy, R Woodroofe
European Journal of Combinatorics 114, 103796, 2023
Órdenes: Magyar Tudományos Akadémia, Slovenian Research Agency, National Office for …
Forbidden subposet problems in the grid
D Gerbner, DT Nagy, B Patkós, M Vizer
Discrete Mathematics 345 (3), 112720, 2022
Órdenes: Magyar Tudományos Akadémia, National Office for Research, Development and …
Triangles in intersecting families
DT Nagy, B Patkós
Mathematika 68 (4), 1073-1079, 2022
Órdenes: Magyar Tudományos Akadémia, National Office for Research, Development and …
On generalized Turán results in height two posets
J Balogh, RR Martin, DT Nagy, B Patkós
SIAM Journal on Discrete Mathematics 36 (2), 1483-1495, 2022
Órdenes: US National Science Foundation, Magyar Tudományos Akadémia, National Office …
On L-close Sperner systems
DT Nagy, B Patkós
Graphs and Combinatorics 37, 789–796, 2021
Órdenes: National Office for Research, Development and Innovation, Hungary
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets
G Damásdi, S Felsner, A Girao, B Keszegh, D Lewis, DT Nagy, T Ueckerdt
SIAM Journal on Discrete Mathematics 35 (2), 915-927, 2021
Órdenes: German Research Foundation, Magyar Tudományos Akadémia, National Office for …
t-wise Berge and t-heavy hypergraphs
D Gerbner, DT Nagy, B Patkós, M Vizer
SIAM Journal on Discrete Mathematics 34 (3), 1813–1829, 2020
Órdenes: Magyar Tudományos Akadémia, National Office for Research, Development and …
Query complexity of Boolean functions on the middle slice of the cube
D Gerbner, B Keszegh, DT Nagy, K Nagy, D Pálvölgyi, B Patkós, ...
Discrete Applied Mathematics 362, 43-49, 2025
Órdenes: European Commission
La información de publicación y financiación se determina de forma automática mediante un programa informático