default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDániel Gerbner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j92]Dániel Gerbner:
Degree powers and number of stars in graphs with a forbidden broom. Discret. Math. 348(1): 114232 (2025)- [j91]Dániel Gerbner:
On non-degenerate Turán problems for expansions. Eur. J. Comb. 124: 104071 (2025) - 2024
- [j90]Dániel Gerbner
, Balázs Patkós:
Generalized Turán results for intersecting cliques. Discret. Math. 347(1): 113710 (2024) - [j89]Dániel Gerbner:
On the extremal graphs in generalized Turán problems. Discret. Math. 347(6): 114021 (2024) - [j88]Dániel Gerbner:
Generalized Turán results for disjoint cliques. Discret. Math. 347(7): 114024 (2024) - [j87]Dániel Gerbner:
On weakly Turán-good graphs. Discuss. Math. Graph Theory 44(4): 1539-1550 (2024) - [j86]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Some exact results for regular Turán problems for all large orders. Eur. J. Comb. 117: 103828 (2024) - [j85]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) - [j84]Dániel Gerbner:
On Non-degenerate Berge-Turán Problems. Graphs Comb. 40(2): 37 (2024) - [j83]János Barát, Dániel Gerbner, Anastasia Halfpap:
On the number of A-transversals in hypergraphs. Period. Math. Hung. 89(1): 107-115 (2024) - 2023
- [j82]Dániel Gerbner:
The covering lemma and q-analogues of extremal set theory problems. Ars Math. Contemp. 24(1): 1 (2023) - [j81]Dániel Gerbner:
Generalized Turán problems for $K_{2,t}$. Electron. J. Comb. 30(1) (2023) - [j80]Dániel Gerbner:
Some Exact Results for Non-Degenerate Generalized Turán Problems. Electron. J. Comb. 30(4) (2023) - [j79]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:
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023) - [j78]Dániel Gerbner, Dániel Lenger, Máté Vizer:
A plurality problem with three colors and query size three. Discret. Math. 346(1): 113151 (2023) - [j77]Dániel Gerbner:
Generalized Turán problems for double stars. Discret. Math. 346(7): 113395 (2023) - [j76]Dániel Gerbner:
Generalized Turán problems for small graphs. Discuss. Math. Graph Theory 43(2): 549-572 (2023) - [j75]Xiutao Zhu, Yaojun Chen, Dániel Gerbner, Ervin Györi, Hilal Hama Karim:
The maximum number of triangles in Fk-free graphs. Eur. J. Comb. 114: 103793 (2023) - [j74]Dániel Gerbner:
Paths are Turán-good. Graphs Comb. 39(3): 56 (2023) - [j73]Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer:
Turán problems for edge-ordered graphs. J. Comb. Theory B 160: 66-113 (2023) - [j72]Dániel Gerbner:
The Profile Polytope of Nontrivial Intersecting Families. SIAM J. Discret. Math. 37(4): 2265-2275 (2023) - [i12]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
- [j71]Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, Cory Palmer:
Generalized Rainbow Turán Numbers. Electron. J. Comb. 29(2) (2022) - [j70]Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Forbidden subposet problems in the grid. Discret. Math. 345(3): 112720 (2022) - [j69]Dániel Gerbner, Zoltán Lóránt Nagy, Máté Vizer:
Unified approach to the generalized Turán problem and supersaturation. Discret. Math. 345(3): 112743 (2022) - [j68]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Saturation problems with regularity constraints. Discret. Math. 345(8): 112921 (2022) - [j67]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Singular Turán numbers and WORM-colorings. Discuss. Math. Graph Theory 42(4): 1061-1074 (2022) - [j66]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On saturation of Berge hypergraphs. Eur. J. Comb. 102: 103477 (2022) - [j65]Dániel Gerbner, Cory Palmer:
Some exact results for generalized Turán problems. Eur. J. Comb. 103: 103519 (2022) - [j64]Dániel Gerbner:
A note on the uniformity threshold for Berge hypergraphs. Eur. J. Comb. 105: 103561 (2022) - [j63]Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, Cory Palmer:
Hypergraph Based Berge Hypergraphs. Graphs Comb. 38(1): 11 (2022) - [j62]Dániel Gerbner, Balázs Patkós:
Generalized Turán Problems for Complete Bipartite Graphs. Graphs Comb. 38(5): 164 (2022) - [j61]Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
Rainbow Ramsey Problems for the Boolean Lattice. Order 39(3): 453-463 (2022) - 2021
- [j60]Dániel Gerbner:
A note on the Turán number of a Berge odd cycle. Australas. J Comb. 79: 205-214 (2021) - [j59]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) - [j58]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. Discret. Appl. Math. 288: 235-245 (2021) - [j57]Dániel Gerbner:
On Turán-good graphs. Discret. Math. 344(8): 112445 (2021) - [j56]Dániel Gerbner, Máté Vizer:
On non-adaptive majority problems of large query size. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j55]Dániel Gerbner:
A Note on Stability for Maximal F-Free Graphs. Graphs Comb. 37(6): 2571-2580 (2021) - [j54]Zoltán Füredi, Dániel Gerbner:
Hypergraphs without exponents. J. Comb. Theory A 184: 105517 (2021) - [j53]Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
On the maximum number of copies of H in graphs with given size and order. J. Graph Theory 96(1): 34-43 (2021) - 2020
- [j52]Máté Vizer, Dániel Gerbner:
Smart elements in combinatorial group testing problems with more defectives. Art Discret. Appl. Math. 3(2) (2020) - [j51]Dániel Gerbner:
On Berge-Ramsey Problems. Electron. J. Comb. 27(2): 2 (2020) - [j50]Akbar Davoodi, Dániel Gerbner, Abhishek Methuku, Máté Vizer:
On clique coverings of complete multipartite graphs. Discret. Appl. Math. 276: 19-23 (2020) - [j49]Dániel Gerbner, Máté Vizer:
Rounds in a combinatorial search problem. Discret. Appl. Math. 276: 60-68 (2020) - [j48]Huilan Chang, Dániel Gerbner, Balázs Patkós:
Finding non-minority balls with majority and plurality queries. Discret. Appl. Math. 284: 631-639 (2020) - [j47]Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao:
Set systems related to a house allocation problem. Discret. Math. 343(7): 111886 (2020) - [j46]Dániel Gerbner, Abhishek Methuku, Cory Palmer:
General lemmas for Berge-Turán hypergraph problems. Eur. J. Comb. 86: 103082 (2020) - [j45]Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer:
Generalized Turán problems for even cycles. J. Comb. Theory B 145: 169-213 (2020) - [j44]Dániel Gerbner, Balázs Keszegh, Balázs Patkós:
Generalized Forbidden Subposet Problems. Order 37(2): 389-410 (2020) - [j43]Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer:
Ramsey Problems for Berge Hypergraphs. SIAM J. Discret. Math. 34(1): 351-369 (2020) - [j42]Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
t-Wise Berge and t-Heavy Hypergraphs. SIAM J. Discret. Math. 34(3): 1813-1829 (2020)
2010 – 2019
- 2019
- [j41]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) - [j40]Sean English, Dániel Gerbner, Abhishek Methuku, Cory Palmer:
On the Weight of Berge-F-Free Hypergraphs. Electron. J. Comb. 26(4): 4 (2019) - [j39]Dániel Gerbner, Máté Vizer:
Majority problems of large query size. Discret. Appl. Math. 254: 124-134 (2019) - [j38]Dániel Gerbner, Abhishek Methuku, Máté Vizer:
Generalized Turán problems for disjoint copies of graphs. Discret. Math. 342(11): 3130-3141 (2019) - [j37]Sean English, Dániel Gerbner, Abhishek Methuku, Michael Tait:
Linearity of saturation for Berge hypergraphs. Eur. J. Comb. 78: 205-213 (2019) - [j36]Dániel Gerbner, Cory Palmer:
Counting copies of a fixed subgraph in F-free graphs. Eur. J. Comb. 82 (2019) - [j35]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) - [j34]Dániel Gerbner, Abhishek Methuku, Máté Vizer:
Asymptotics for the Turán number of Berge-K2, t. J. Comb. Theory B 137: 264-290 (2019) - [j33]Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer:
An improvement on the maximum number of k?dominating independent sets. J. Graph Theory 91(1): 88-97 (2019) - [j32]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) - [i11]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) - [i10]Dániel Gerbner:
Between the deterministic and non-deterministic query complexity. CoRR abs/1907.09531 (2019) - 2018
- [j31]Dániel Gerbner, Balázs Patkós, Máté Vizer:
Forbidden Subposet Problems for Traces of Set Families. Electron. J. Comb. 25(3): 3 (2018) - [j30]Fabrício Benevides, Dániel Gerbner, Cory Palmer, Dominik K. Vu:
Identifying defective sets using queries of small size. Discret. Math. 341(1): 143-150 (2018) - [j29]Dániel Gerbner, Máté Vizer:
Smart elements in combinatorial group testing problems. J. Comb. Optim. 35(4): 1042-1060 (2018) - [j28]Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós:
On the Number of Cycles in a Graph with Restricted Cycle Lengths. SIAM J. Discret. Math. 32(1): 266-279 (2018) - [j27]Dániel Gerbner, Balázs Keszegh, Gábor Mészáros, Balázs Patkós, Máté Vizer:
Line Percolation in Finite Projective Planes. SIAM J. Discret. Math. 32(2): 864-881 (2018) - 2017
- [j26]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. Ars Math. Contemp. 12(2): 301-314 (2017) - [j25]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Finding a non-minority ball with majority answers. Discret. Appl. Math. 219: 18-31 (2017) - [j24]Dániel Gerbner, Abhishek Methuku, Casey Tompkins:
Intersecting P-free families. J. Comb. Theory A 151: 61-83 (2017) - [j23]Dániel Gerbner, Cory Palmer:
Extremal Results for Berge Hypergraphs. SIAM J. Discret. Math. 31(4): 2314-2327 (2017) - [i9]Dániel Gerbner, Máté Vizer:
Conscious and controlling elements in combinatorial group testing problems. CoRR abs/1703.05398 (2017) - [i8]Dániel Gerbner, Máté Vizer:
Conscious and controlling elements in combinatorial group testing problems with more defectives. CoRR abs/1705.08539 (2017) - [i7]Dániel Gerbner, Dániel Lenger, Máté Vizer:
A plurality problem with three colors and query size three. CoRR abs/1708.05864 (2017) - 2016
- [j22]Dániel Gerbner, Máté Vizer:
A note on tilted Sperner families with patterns. Discret. Math. 339(11): 2737-2741 (2016) - [j21]Dániel Gerbner, Balázs Keszegh, Cory Palmer, Dömötör Pálvölgyi:
Topological orderings of weighted directed acyclic graphs. Inf. Process. Lett. 116(9): 564-568 (2016) - 2015
- [j20]Zoltán Füredi, Dániel Gerbner, Máté Vizer:
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets. Eur. J. Comb. 48: 224-233 (2015) - [j19]Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Finding a majority ball with majority answers. Electron. Notes Discret. Math. 49: 345-351 (2015) - 2014
- [j18]József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy:
Partitioning 2-edge-colored graphs by monochromatic paths and cycles. Comb. 34(5): 507-526 (2014) - [j17]János Barát, Dániel Gerbner:
Edge-decomposition of Graphs into Copies of a Tree with Four Edges. Electron. J. Comb. 21(1): 1 (2014) - [j16]Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth:
Covering Paths for Planar Point Sets. Discret. Comput. Geom. 51(2): 462-484 (2014) - [j15]Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote:
Advantage in the discrete Voronoi game. J. Graph Algorithms Appl. 18(3): 439-457 (2014) - 2013
- [j14]Dániel Gerbner:
Profile polytopes of some classes of families. Comb. 33(2): 199-216 (2013) - [j13]Dániel Gerbner, Géza Tóth:
Separating families of convex sets. Comput. Geom. 46(9): 1056-1058 (2013) - [j12]Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós:
Majority and plurality problems. Discret. Appl. Math. 161(6): 813-818 (2013) - [j11]Dániel Gerbner:
The Magnus-Derek game in groups. Discret. Math. Theor. Comput. Sci. 15(3): 119-126 (2013) - [j10]Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi:
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets. Graphs Comb. 29(3): 489-498 (2013) - [j9]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Saturating Sperner Families. Graphs Comb. 29(5): 1355-1364 (2013) - [c1]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Density-Based Group Testing. Information Theory, Combinatorics, and Search Theory 2013: 543-556 - [i6]Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth:
Covering Paths for Planar Point Sets. CoRR abs/1303.0262 (2013) - [i5]Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote:
Advantage in the discrete Voronoi game. CoRR abs/1303.0523 (2013) - 2012
- [j8]Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, Balázs Patkós:
Two-Part Set Systems. Electron. J. Comb. 19(1): 52 (2012) - [j7]Dániel Gerbner, Balázs Keszegh, Cory Palmer:
Generalizations of the tree packing conjecture. Discuss. Math. Graph Theory 32(3): 569-582 (2012) - [j6]Dániel Gerbner, Nathan Lemons, Cory Palmer, Balázs Patkós, Vajk Szécsi:
Almost Intersecting Families of Sets. SIAM J. Discret. Math. 26(4): 1657-1669 (2012) - [i4]Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós:
Majority and Plurality Problems. CoRR abs/1203.1398 (2012) - [i3]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Density-based group testing. CoRR abs/1204.1464 (2012) - [i2]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. CoRR abs/1211.3000 (2012) - 2011
- [i1]Dániel Gerbner, Balázs Keszegh:
Path-search in the pyramid and in other graphs. CoRR abs/1104.5098 (2011) - 2010
- [j5]Dániel Gerbner, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Finding the maximum and minimum elements with one lie. Discret. Appl. Math. 158(9): 988-995 (2010) - [j4]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Polychromatic colorings of arbitrary rectangular partitions. Discret. Math. 310(1): 21-30 (2010)
2000 – 2009
- 2009
- [b1]Dániel Gerbner:
Extremal Combinatorial Problems. Eötvös Loránd University, Hungary, 2009 - [j3]Dániel Gerbner, Balázs Patkós:
Profile vectors in the lattice of subspaces. Discret. Math. 309(9): 2861-2869 (2009) - 2008
- [j2]Dániel Gerbner, Balázs Patkós:
l-Chain Profile Vectors. SIAM J. Discret. Math. 22(1): 185-193 (2008) - 2007
- [j1]Attila Bernáth, Dániel Gerbner:
Chain Intersecting Families. Graphs Comb. 23(4): 353-366 (2007)
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-10-07 21:23 CEST 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:
