default search action
Dániel T. Nagy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Nika Salia
, Máté Vizer:
Stability of extremal connected hypergraphs avoiding Berge-paths. Eur. J. Comb. 118: 103930 (2024) - [j23]Dániel T. Nagy
Chain-dependent Conditions in Extremal Set Theory. Order 41(2): 551-559 (2024) - 2023
- [j22]Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023) - [j21]Dániel T. Nagy, Zoltán Lóránt Nagy, Russ Woodroofe
The extensible No-Three-In-Line problem. Eur. J. Comb. 114: 103796 (2023) - [j20]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy
Turán problems for edge-ordered graphs. J. Comb. Theory B 160: 66-113 (2023) - [i3]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:
Query complexity of Boolean functions on the middle slice of the cube. CoRR abs/2309.13678 (2023) - 2022
- [j19]Dániel Gerbner
Forbidden subposet problems in the grid. Discret. Math. 345(3): 112720 (2022) - [j18]Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li
Rainbow Ramsey Problems for the Boolean Lattice. Order 39(3): 453-463 (2022) - [j17]József Balogh, Ryan R. Martin
On Generalized Turán Results in Height Two Posets. SIAM J. Discret. Math. 36(2): 1483-1495 (2022) - 2021
- [j16]Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Supersaturation, Counting, and Randomness in Forbidden Subposet Problems. Electron. J. Comb. 28(1): 1 (2021) - [j15]Gábor Damásdi
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288: 235-245 (2021) - [j14]Dániel T. Nagy, Balázs Patkós
On L-Close Sperner Systems. Graphs Comb. 37(3): 789-796 (2021) - [j13]Dániel Gerbner
On the maximum number of copies of H in graphs with given size and order. J. Graph Theory 96(1): 34-43 (2021) - [j12]Gábor Damásdi
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. SIAM J. Discret. Math. 35(2): 915-927 (2021) - 2020
- [j11]Dániel Gerbner
Set systems related to a house allocation problem. Discret. Math. 343(7): 111886 (2020) - [j10]Gábor Damásdi
Triangle areas in line arrangements. Discret. Math. 343(12): 112105 (2020) - [j9]Dániel Gerbner, Dániel T. Nagy
t-Wise Berge and t-Heavy Hypergraphs. SIAM J. Discret. Math. 34(3): 1813-1829 (2020) - [i2]Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. CoRR abs/2001.06367 (2020)
2010 – 2019
- 2019
- [j8]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Stability Results for Vertex Turán Problems in Kneser Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j7]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
On the Number of Containments in P-free Families. Graphs Comb. 35(6): 1519-1540 (2019) - [j6]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Forbidding Rank-Preserving Copies of a Poset. Order 36(3): 611-620 (2019) - [i1]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:
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR abs/1903.08383 (2019) - 2018
- [j5]Dániel T. Nagy:
Forbidden subposet problems with size restrictions. J. Comb. Theory A 155: 42-66 (2018) - 2017
- [j4]Dániel T. Nagy:
On the Number of 4-Edge Paths in Graphs With Given Edge Density. Comb. Probab. Comput. 26(3): 431-447 (2017) - 2015
- [j3]Gyula O. H. Katona, Dániel T. Nagy:
Union-Intersecting Set Systems. Graphs Comb. 31(5): 1507-1516 (2015) - [j2]Gyula O. H. Katona, Dániel T. Nagy:
Incomparable Copies of a Poset in the Boolean Lattice. Order 32(3): 419-427 (2015) - 2013
- [j1]Peter Burcsi, Dániel T. Nagy:
The method of double chains for largest families with excluded subposets. Electron. J. Graph Theory Appl. 1(1): 40-49 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: