Dániel Gerbner

121 papers Journal 119Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A note on vertex Turán problems in the Kneser cube.
Graphs Comb.
Dániel Gerbner, Balázs Patkós
2026 J jnl
On Turán problems for suspension hypergraphs.
Discret. Math.
Xin Cheng, Dániel Gerbner, Hilal Hama Karim, Junpeng Zhou
2026 J jnl
On Turán-Type Problems and the Abstract Chromatic Number.
Electron. J. Comb.
Dániel Gerbner, Hilal Hama Karim, Gaurav Kucheriya
2026 J jnl
On forbidding graphs as traces of hypergraphs.
Discret. Math.
Dániel Gerbner, Michael E. Picollelli
2026 J jnl
Uniquely C 4 + -saturated graphs.
Discret. Math.
Yuying Li, Kexiang Xu, Dániel Gerbner, Wenzhong Liu
2025 J jnl
A note on strongly and totally chain intersecting families.
Graphs Comb.
Dániel Gerbner
2025 J jnl
Cooperation in combinatorial search.
Optim. Lett.
Dániel Gerbner, Balázs Keszegh, Kartal Nagy, Balázs Patkós, Gábor Wiener
2025 J jnl
Degree powers and number of stars in graphs with a forbidden broom.
Discret. Math.
Dániel Gerbner
2025 J jnl
Finding the diameter of a tree with distance queries.
CoRR
Dániel Gerbner, András Imolay, Kartal Nagy, Balázs Patkós, Kristóf Zólomy
2025 J jnl
On degree powers and counting stars in F-free graphs.
Eur. J. Comb.
Dániel Gerbner
2025 J jnl
On hypergraph Turán problems with bounded matching number.
Eur. J. Comb.
Dániel Gerbner, Casey Tompkins, Junpeng Zhou
2025 J jnl
On non-degenerate Turán problems for expansions.
Eur. J. Comb.
Dániel Gerbner
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
Directed Graphs Without Rainbow Stars.
Electron. J. Comb.
Dániel Gerbner, Andrzej Grzesik, Cory Palmer, Magdalena Prorok
2024 J jnl
Generalized Turán results for disjoint cliques.
Discret. Math.
Dániel Gerbner
2024 J jnl
Generalized Turán results for intersecting cliques.
Discret. Math.
Dániel Gerbner, Balázs Patkós
2024 J jnl
On Non-degenerate Berge-Turán Problems.
Graphs Comb.
Dániel Gerbner
2024 J jnl
On Turán problems with bounded matching number.
J. Graph Theory
Dániel Gerbner
2024 J jnl
On the extremal graphs in generalized Turán problems.
Discret. Math.
Dániel Gerbner
2024 J jnl
On the number of A-transversals in hypergraphs.
Period. Math. Hung.
János Barát, Dániel Gerbner, Anastasia Halfpap
2024 J jnl
On weakly Turán-good graphs.
Discuss. Math. Graph Theory
Dániel Gerbner
2024 J jnl
Some exact results for regular Turán problems for all large orders.
Eur. J. Comb.
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2024 J jnl
Stability from graph symmetrization arguments in generalized Turán problems.
J. Graph Theory
Dániel Gerbner, Hilal Hama Karim
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
2024 J jnl
The Turán Number of Berge Book Hypergraphs.
SIAM J. Discret. Math.
Dániel Gerbner
2023 J jnl
A plurality problem with three colors and query size three.
Discret. Math.
Dániel Gerbner, Dániel Lenger, Máté Vizer
2023 J jnl
Generalized Turán problems for $K_{2,t}$.
Electron. J. Comb.
Dániel Gerbner
2023 J jnl
Generalized Turán problems for double stars.
Discret. Math.
Dániel Gerbner
2023 J jnl
Generalized Turán problems for small graphs.
Discuss. Math. Graph Theory
Dániel Gerbner
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
Paths are Turán-good.
Graphs Comb.
Dániel Gerbner
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
Some Exact Results for Non-Degenerate Generalized Turán Problems.
Electron. J. Comb.
Dániel Gerbner
2023 J jnl
The Profile Polytope of Nontrivial Intersecting Families.
SIAM J. Discret. Math.
Dániel Gerbner
2023 J jnl
The covering lemma and q-analogues of extremal set theory problems.
Ars Math. Contemp.
Dániel Gerbner
2023 J jnl
The maximum number of triangles in Fk-free graphs.
Eur. J. Comb.
Xiutao Zhu, Yaojun Chen, Dániel Gerbner, Ervin Györi, Hilal Hama Karim
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
A note on the uniformity threshold for Berge hypergraphs.
Eur. J. Comb.
Dániel Gerbner
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
Generalized Rainbow Turán Numbers.
Electron. J. Comb.
Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, Cory Palmer
2022 J jnl
Generalized Turán Problems for Complete Bipartite Graphs.
Graphs Comb.
Dániel Gerbner, Balázs Patkós
2022 J jnl
Hypergraph Based Berge Hypergraphs.
Graphs Comb.
Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, Cory Palmer
2022 J jnl
On saturation of Berge hypergraphs.
Eur. J. Comb.
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
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
2022 J jnl
Saturation problems with regularity constraints.
Discret. Math.
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2022 J jnl
Singular Turán numbers and WORM-colorings.
Discuss. Math. Graph Theory
Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer
2022 J jnl
Some exact results for generalized Turán problems.
Eur. J. Comb.
Dániel Gerbner, Cory Palmer
2022 J jnl
Unified approach to the generalized Turán problem and supersaturation.
Discret. Math.
Dániel Gerbner, Zoltán Lóránt Nagy, Máté Vizer
2021 J jnl
A Note on Stability for Maximal F-Free Graphs.
Graphs Comb.
Dániel Gerbner
2021 J jnl
A note on the Turán number of a Berge odd cycle.
Australas. J Comb.
Dániel Gerbner
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
Hypergraphs without exponents.
J. Comb. Theory A
Zoltán Füredi, Dániel Gerbner
2021 J jnl
On Turán-good graphs.
Discret. Math.
Dániel Gerbner
2021 J jnl
On non-adaptive majority problems of large query size.
Discret. Math. Theor. Comput. Sci.
Dániel Gerbner, Máté Vizer
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
Finding non-minority balls with majority and plurality queries.
Discret. Appl. Math.
Huilan Chang, Dániel Gerbner, Balázs Patkós
2020 J jnl
General lemmas for Berge-Turán hypergraph problems.
Eur. J. Comb.
Dániel Gerbner, Abhishek Methuku, Cory Palmer
2020 J jnl
Generalized Forbidden Subposet Problems.
Order
Dániel Gerbner, Balázs Keszegh, Balázs Patkós
2020 J jnl
Generalized Turán problems for even cycles.
J. Comb. Theory B
Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer
2020 J jnl
On Berge-Ramsey Problems.
Electron. J. Comb.
Dániel Gerbner
2020 J jnl
On clique coverings of complete multipartite graphs.
Discret. Appl. Math.
Akbar Davoodi, Dániel Gerbner, Abhishek Methuku, Máté Vizer
2020 J jnl
Ramsey Problems for Berge Hypergraphs.
SIAM J. Discret. Math.
Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer
2020 J jnl
Rounds in a combinatorial search problem.
Discret. Appl. Math.
Dániel Gerbner, Máté Vizer
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
Smart elements in combinatorial group testing problems with more defectives.
Art Discret. Appl. Math.
Máté Vizer, Dániel Gerbner
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
An improvement on the maximum number of k?dominating independent sets.
J. Graph Theory
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer
2019 J jnl
Asymptotics for the Turán number of Berge-
J. Comb. Theory B
Dániel Gerbner, Abhishek Methuku, Máté Vizer
2019 J jnl
Between the deterministic and non-deterministic query complexity.
CoRR
Dániel Gerbner
2019 J jnl
Counting copies of a fixed subgraph in F-free graphs.
Eur. J. Comb.
Dániel Gerbner, Cory Palmer
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
Generalized Turán problems for disjoint copies of graphs.
Discret. Math.
Dániel Gerbner, Abhishek Methuku, Máté Vizer
2019 J jnl
Linearity of saturation for Berge hypergraphs.
Eur. J. Comb.
Sean English, Dániel Gerbner, Abhishek Methuku, Michael Tait
2019 J jnl
Majority problems of large query size.
Discret. Appl. Math.
Dániel Gerbner, 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
On the Weight of Berge-F-Free Hypergraphs.
Electron. J. Comb.
Sean English, Dániel Gerbner, Abhishek Methuku, Cory Palmer
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 for Traces of Set Families.
Electron. J. Comb.
Dániel Gerbner, Balázs Patkós, Máté Vizer
2018 J jnl
Identifying defective sets using queries of small size.
Discret. Math.
Fabrício Benevides, Dániel Gerbner, Cory Palmer, Dominik K. Vu
2018 J jnl
Line Percolation in Finite Projective Planes.
SIAM J. Discret. Math.
Dániel Gerbner, Balázs Keszegh, Gábor Mészáros, Balázs Patkós, Máté Vizer
2018 J jnl
On the Number of Cycles in a Graph with Restricted Cycle Lengths.
SIAM J. Discret. Math.
Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós
2018 J jnl
Smart elements in combinatorial group testing problems.
J. Comb. Optim.
Dániel Gerbner, Máté Vizer
2017 J jnl
A plurality problem with three colors and query size three.
CoRR
Dániel Gerbner, Dániel Lenger, Máté Vizer
2017 J jnl
Conscious and controlling elements in combinatorial group testing problems with more defectives.
CoRR
Dániel Gerbner, Máté Vizer
2017 J jnl
Conscious and controlling elements in combinatorial group testing problems.
CoRR
Dániel Gerbner, Máté Vizer
2017 J jnl
Extremal Results for Berge Hypergraphs.
SIAM J. Discret. Math.
Dániel Gerbner, Cory Palmer
2017 J jnl
Finding a non-minority ball with majority answers.
Discret. Appl. Math.
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
2017 J jnl
Intersecting P-free families.
J. Comb. Theory A
Dániel Gerbner, Abhishek Methuku, Casey Tompkins
2017 J jnl
Search for the end of a path in the d-dimensional grid and in other graphs.
Ars Math. Contemp.
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener
2016 J jnl
A note on tilted Sperner families with patterns.
Discret. Math.
Dániel Gerbner, Máté Vizer
2016 J jnl
Topological orderings of weighted directed acyclic graphs.
Inf. Process. Lett.
Dániel Gerbner, Balázs Keszegh, Cory Palmer, Dömötör Pálvölgyi
2015 J jnl
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets.
Eur. J. Comb.
Zoltán Füredi, Dániel Gerbner, Máté Vizer
2015 J jnl
Finding a majority ball with majority answers.
Electron. Notes Discret. Math.
Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
2014 J jnl
Advantage in the discrete Voronoi game.
J. Graph Algorithms Appl.
Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote
2014 J jnl
Covering Paths for Planar Point Sets.
Discret. Comput. Geom.
Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth
2014 J jnl
Edge-decomposition of Graphs into Copies of a Tree with Four Edges.
Electron. J. Comb.
János Barát, Dániel Gerbner
2014 J jnl
Partitioning 2-edge-colored graphs by monochromatic paths and cycles.
Comb.
József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy
2013 J jnl
Advantage in the discrete Voronoi game
CoRR
Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote
2013 J jnl
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets.
Graphs Comb.
Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi
2013 J jnl
Covering Paths for Planar Point Sets
CoRR
Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth
2013 — conf
Density-Based Group Testing.
Information Theory, Combinatorics, and Search Theory
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
2013 J jnl
Majority and plurality problems.
Discret. Appl. Math.
Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós
2013 J jnl
Profile polytopes of some classes of families.
Comb.
Dániel Gerbner
2013 J jnl
Saturating Sperner Families.
Graphs Comb.
Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós
2013 J jnl
Separating families of convex sets.
Comput. Geom.
Dániel Gerbner, Géza Tóth
2013 J jnl
The Magnus-Derek game in groups.
Discret. Math. Theor. Comput. Sci.
Dániel Gerbner
2012 J jnl
Almost Intersecting Families of Sets.
SIAM J. Discret. Math.
Dániel Gerbner, Nathan Lemons, Cory Palmer, Balázs Patkós, Vajk Szécsi
2012 J jnl
Density-based group testing
CoRR
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
2012 J jnl
Generalizations of the tree packing conjecture.
Discuss. Math. Graph Theory
Dániel Gerbner, Balázs Keszegh, Cory Palmer
2012 J jnl
Majority and Plurality Problems
CoRR
Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós
2012 J jnl
Search for the end of a path in the d-dimensional grid and in other graphs
CoRR
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
2012 J jnl
Two-Part Set Systems.
Electron. J. Comb.
Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, Balázs Patkós
2011 J jnl
Path-search in the pyramid and in other graphs
CoRR
Dániel Gerbner, Balázs Keszegh
2010 J jnl
Finding the maximum and minimum elements with one lie.
Discret. Appl. Math.
Dániel Gerbner, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
2010 J jnl
Polychromatic colorings of arbitrary rectangular partitions.
Discret. Math.
Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós
2009 — —
Extremal Combinatorial Problems
Dániel Gerbner
2009 J jnl
Profile vectors in the lattice of subspaces.
Discret. Math.
Dániel Gerbner, Balázs Patkós
2008 J jnl
l-Chain Profile Vectors.
SIAM J. Discret. Math.
Dániel Gerbner, Balázs Patkós
2007 J jnl
Chain Intersecting Families.
Graphs Comb.
Attila Bernáth, Dániel Gerbner