Dániel Gerbner

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 76

Top Venues

Publications

Dániel Gerbner
On the extremal graphs in generalized Turán problems. Discret. Math. 347 (6) (2024)
Dániel Gerbner, Balázs Patkós
Generalized Turán results for intersecting cliques. Discret. Math. 347 (1) (2024)
János Barát, Dániel Gerbner, Anastasia Halfpap
On the number of A-transversals in hypergraphs. Period. Math. Hung. 89 (1) (2024)
Dániel Gerbner
On Non-degenerate Berge-Turán Problems. Graphs Comb. 40 (2) (2024)
Dániel Gerbner
Generalized Turán results for disjoint cliques. Discret. Math. 347 (7) (2024)
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 (2024)
Dániel Gerbner
On weakly Turán-good graphs. Discuss. Math. Graph Theory 44 (4) (2024)
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 (2024)
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 (2023)
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 (2023)
Dániel Gerbner
The Profile Polytope of Nontrivial Intersecting Families. SIAM J. Discret. Math. 37 (4) (2023)
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, Ser. B 160 (2023)
Dániel Gerbner, Dániel Lenger, Máté Vizer
A plurality problem with three colors and query size three. Discret. Math. 346 (1) (2023)
Dániel Gerbner
Some Exact Results for Non-Degenerate Generalized Turán Problems. Electron. J. Comb. 30 (4) (2023)
Dániel Gerbner
Generalized Turán problems for small graphs. Discuss. Math. Graph Theory 43 (2) (2023)
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
copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341 (2023)
Dániel Gerbner
Generalized Turán problems for $K_{2,t}$. Electron. J. Comb. 30 (1) (2023)
Dániel Gerbner
Paths are Turán-good. Graphs Comb. 39 (3) (2023)
Dániel Gerbner
The covering lemma and q-analogues of extremal set theory problems. Ars Math. Contemp. 24 (1) (2023)
Dániel Gerbner
Generalized Turán problems for double stars. Discret. Math. 346 (7) (2023)
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) (2022)
Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, Cory Palmer
Hypergraph Based Berge Hypergraphs. Graphs Comb. 38 (1) (2022)
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) (2022)
Dániel Gerbner, Balázs Patkós
Generalized Turán Problems for Complete Bipartite Graphs. Graphs Comb. 38 (5) (2022)
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
On saturation of Berge hypergraphs. Eur. J. Comb. 102 (2022)
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Forbidden subposet problems in the grid. Discret. Math. 345 (3) (2022)
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) (2022)
Dániel Gerbner, Cory Palmer
Some exact results for generalized Turán problems. Eur. J. Comb. 103 (2022)
Dániel Gerbner
A note on the uniformity threshold for Berge hypergraphs. Eur. J. Comb. 105 (2022)
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
Saturation problems with regularity constraints. Discret. Math. 345 (8) (2022)
Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, Cory Palmer
Generalized Rainbow Turán Numbers. Electron. J. Comb. 29 (2) (2022)
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 (2021)
Dániel Gerbner
A note on the Turán number of a Berge odd cycle. Australas. J Comb. 79 (2021)
Dániel Gerbner
On Turán-good graphs. Discret. Math. 344 (8) (2021)
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) (2021)
Zoltán Füredi, Dániel Gerbner
Hypergraphs without exponents. J. Comb. Theory, Ser. A 184 (2021)
Dániel Gerbner, Máté Vizer
On non-adaptive majority problems of large query size. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Dániel Gerbner
A Note on Stability for Maximal F-Free Graphs. Graphs Comb. 37 (6) (2021)
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) (2021)
Máté Vizer, Dániel Gerbner
Smart elements in combinatorial group testing problems with more defectives. Art Discret. Appl. Math. 3 (2) (2020)
Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer
Generalized Turán problems for even cycles. J. Comb. Theory, Ser. B 145 (2020)
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) (2020)
Dániel Gerbner, Abhishek Methuku, Cory Palmer
General lemmas for Berge-Turán hypergraph problems. Eur. J. Comb. 86 (2020)
Dániel Gerbner, Máté Vizer
Rounds in a combinatorial search problem. Discret. Appl. Math. 276 (2020)
Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer
Ramsey Problems for Berge Hypergraphs. SIAM J. Discret. Math. 34 (1) (2020)
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) (2020)
Dániel Gerbner, Balázs Keszegh, Balázs Patkós
Generalized Forbidden Subposet Problems. Order 37 (2) (2020)
Huilan Chang, Dániel Gerbner, Balázs Patkós
Finding non-minority balls with majority and plurality queries. Discret. Appl. Math. 284 (2020)
Dániel Gerbner
On Berge-Ramsey Problems. Electron. J. Comb. 27 (2) (2020)
Akbar Davoodi, Dániel Gerbner, Abhishek Methuku, Máté Vizer
On clique coverings of complete multipartite graphs. Discret. Appl. Math. 276 (2020)
Sean English, Dániel Gerbner, Abhishek Methuku, Michael Tait
Linearity of saturation for Berge hypergraphs. Eur. J. Comb. 78 (2019)
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 (2019)
Dániel Gerbner, Abhishek Methuku, Máté Vizer
Generalized Turán problems for disjoint copies of graphs. Discret. Math. 342 (11) (2019)
Sean English, Dániel Gerbner, Abhishek Methuku, Cory Palmer
On the Weight of Berge-F-Free Hypergraphs. Electron. J. Comb. 26 (4) (2019)
Dániel Gerbner, Abhishek Methuku, Máté Vizer
. J. Comb. Theory, Ser. B 137 (2019)
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) (2019)
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) (2019)
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) (2019)
Dániel Gerbner, Cory Palmer
Counting copies of a fixed subgraph in F-free graphs. Eur. J. Comb. 82 (2019)
Dániel Gerbner, Máté Vizer
Majority problems of large query size. Discret. Appl. Math. 254 (2019)
Dániel Gerbner
Between the deterministic and non-deterministic query complexity. CoRR (2019)
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) (2019)
Fabrício Benevides, Dániel Gerbner, Cory Palmer, Dominik K. Vu
Identifying defective sets using queries of small size. Discret. Math. 341 (1) (2018)
Dániel Gerbner, Máté Vizer
Smart elements in combinatorial group testing problems. J. Comb. Optim. 35 (4) (2018)
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) (2018)
Dániel Gerbner, Balázs Patkós, Máté Vizer
Forbidden Subposet Problems for Traces of Set Families. Electron. J. Comb. 25 (3) (2018)
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) (2018)
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 (2017)
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) (2017)
Dániel Gerbner, Cory Palmer
Extremal Results for Berge Hypergraphs. SIAM J. Discret. Math. 31 (4) (2017)
Dániel Gerbner, Máté Vizer
Conscious and controlling elements in combinatorial group testing problems with more defectives. CoRR (2017)
Dániel Gerbner, Abhishek Methuku, Casey Tompkins
Intersecting P-free families. J. Comb. Theory, Ser. A 151 (2017)
Dániel Gerbner, Dániel Lenger, Máté Vizer
A plurality problem with three colors and query size three. CoRR (2017)
Dániel Gerbner, Máté Vizer
Conscious and controlling elements in combinatorial group testing problems. CoRR (2017)
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) (2016)
Dániel Gerbner, Máté Vizer
A note on tilted Sperner families with patterns. Discret. Math. 339 (11) (2016)
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 (2015)
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 (2015)
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) (2014)
Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth
Covering Paths for Planar Point Sets. Discret. Comput. Geom. 51 (2) (2014)
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) (2014)
János Barát, Dániel Gerbner
Edge-decomposition of Graphs into Copies of a Tree with Four Edges. Electron. J. Comb. 21 (1) (2014)
Dániel Gerbner
Profile polytopes of some classes of families. Comb. 33 (2) (2013)
Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth
Covering Paths for Planar Point Sets CoRR (2013)
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) (2013)
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)
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 (2013)
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) (2013)
Dániel Gerbner
The Magnus-Derek game in groups. Discret. Math. Theor. Comput. Sci. 15 (3) (2013)
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) (2013)
Dániel Gerbner, Géza Tóth
Separating families of convex sets. Comput. Geom. 46 (9) (2013)
Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós
Majority and Plurality Problems CoRR (2012)
Dániel Gerbner, Balázs Keszegh, Cory Palmer
Generalizations of the tree packing conjecture. Discuss. Math. Graph Theory 32 (3) (2012)
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) (2012)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
Density-based group testing CoRR (2012)
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 (2012)
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) (2012)
Dániel Gerbner, Balázs Keszegh
Path-search in the pyramid and in other graphs CoRR (2011)
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) (2010)
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) (2010)

Dániel Gerbner.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dániel Gerbner