According to our database
1,
Dániel Gerbner
authored at least 101 papers
between 2007 and 2025.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2025
On non-degenerate Turán problems for expansions.
Eur. J. Comb., 2025
Degree powers and number of stars in graphs with a forbidden broom.
Discret. Math., 2025
2024
On the number of A-transversals in hypergraphs.
Period. Math. Hung., September, 2024
On Non-degenerate Berge-Turán Problems.
Graphs Comb., April, 2024
Some exact results for regular Turán problems for all large orders.
Eur. J. Comb., March, 2024
Generalized Turán results for intersecting cliques.
Discret. Math., January, 2024
The Turán Number of Berge Book Hypergraphs.
SIAM J. Discret. Math., 2024
Stability of extremal connected hypergraphs avoiding Berge-paths.
Eur. J. Comb., 2024
On weakly Turán-good graphs.
Discuss. Math. Graph Theory, 2024
Generalized Turán results for disjoint cliques.
Discret. Math., 2024
On the extremal graphs in generalized Turán problems.
Discret. Math., 2024
2023
The Profile Polytope of Nontrivial Intersecting Families.
SIAM J. Discret. Math., December, 2023
The maximum number of triangles in Fk-free graphs.
Eur. J. Comb., December, 2023
On graphs that contain exactly <i>k</i> copies of a subgraph, and a related problem in search theory.
Discret. Appl. Math., December, 2023
Generalized Turán problems for double stars.
Discret. Math., July, 2023
Turán problems for edge-ordered graphs.
J. Comb. Theory B, May, 2023
Generalized Turán problems for small graphs.
Discuss. Math. Graph Theory, 2023
A plurality problem with three colors and query size three.
Discret. Math., 2023
Query complexity of Boolean functions on the middle slice of the cube.
CoRR, 2023
Some Exact Results for Non-Degenerate Generalized Turán Problems.
Electron. J. Comb., 2023
Generalized Turán problems for $K_{2,t}$.
Electron. J. Comb., 2023
The covering lemma and q-analogues of extremal set theory problems.
Ars Math. Contemp., 2023
2022
Rainbow Ramsey Problems for the Boolean Lattice.
Order, October, 2022
Generalized Turán Problems for Complete Bipartite Graphs.
Graphs Comb., 2022
Hypergraph Based Berge Hypergraphs.
Graphs Comb., 2022
On saturation of Berge hypergraphs.
Eur. J. Comb., 2022
Some exact results for generalized Turán problems.
Eur. J. Comb., 2022
A note on the uniformity threshold for Berge hypergraphs.
Eur. J. Comb., 2022
Singular Turán numbers and WORM-colorings.
Discuss. Math. Graph Theory, 2022
Saturation problems with regularity constraints.
Discret. Math., 2022
Unified approach to the generalized Turán problem and supersaturation.
Discret. Math., 2022
Forbidden subposet problems in the grid.
Discret. Math., 2022
Generalized Rainbow Turán Numbers.
Electron. J. Comb., 2022
2021
On the maximum number of copies of H in graphs with given size and order.
J. Graph Theory, 2021
Hypergraphs without exponents.
J. Comb. Theory A, 2021
A Note on Stability for Maximal F-Free Graphs.
Graphs Comb., 2021
On non-adaptive majority problems of large query size.
Discret. Math. Theor. Comput. Sci., 2021
Adaptive majority problems for restricted query graphs and for weighted sets.
,
,
,
,
,
,
,
,
,
,
Discret. Appl. Math., 2021
Supersaturation, Counting, and Randomness in Forbidden Subposet Problems.
Electron. J. Comb., 2021
A note on the Turán number of a Berge odd cycle.
Australas. J Comb., 2021
2020
t-Wise Berge and t-Heavy Hypergraphs.
SIAM J. Discret. Math., 2020
Ramsey Problems for Berge Hypergraphs.
SIAM J. Discret. Math., 2020
Generalized Forbidden Subposet Problems.
Order, 2020
Generalized Turán problems for even cycles.
J. Comb. Theory B, 2020
General lemmas for Berge-Turán hypergraph problems.
Eur. J. Comb., 2020
Set systems related to a house allocation problem.
Discret. Math., 2020
Rounds in a combinatorial search problem.
Discret. Appl. Math., 2020
On clique coverings of complete multipartite graphs.
Discret. Appl. Math., 2020
Finding non-minority balls with majority and plurality queries.
Discret. Appl. Math., 2020
On Berge-Ramsey Problems.
Electron. J. Comb., 2020
Smart elements in combinatorial group testing problems with more defectives.
Art Discret. Appl. Math., 2020
2019
Forbidding Rank-Preserving Copies of a Poset.
Order, 2019
An improvement on the maximum number of k?dominating independent sets.
J. Graph Theory, 2019
Asymptotics for the Turán number of Berge-<i>K</i><sub>2, <i>t</i></sub>.
J. Comb. Theory B, 2019
On the Number of Containments in P-free Families.
Graphs Comb., 2019
Counting copies of a fixed subgraph in F-free graphs.
Eur. J. Comb., 2019
Linearity of saturation for Berge hypergraphs.
Eur. J. Comb., 2019
Generalized Turán problems for disjoint copies of graphs.
Discret. Math., 2019
Majority problems of large query size.
Discret. Appl. Math., 2019
Between the deterministic and non-deterministic query complexity.
CoRR, 2019
Stability Results for Vertex Turán Problems in Kneser Graphs.
Electron. J. Comb., 2019
On the Weight of Berge-F-Free Hypergraphs.
Electron. J. Comb., 2019
2018
On the Number of Cycles in a Graph with Restricted Cycle Lengths.
SIAM J. Discret. Math., 2018
Line Percolation in Finite Projective Planes.
SIAM J. Discret. Math., 2018
Smart elements in combinatorial group testing problems.
J. Comb. Optim., 2018
Identifying defective sets using queries of small size.
Discret. Math., 2018
Forbidden Subposet Problems for Traces of Set Families.
Electron. J. Comb., 2018
2017
Extremal Results for Berge Hypergraphs.
SIAM J. Discret. Math., 2017
Intersecting P-free families.
J. Comb. Theory A, 2017
Finding a non-minority ball with majority answers.
Discret. Appl. Math., 2017
Conscious and controlling elements in combinatorial group testing problems with more defectives.
CoRR, 2017
Conscious and controlling elements in combinatorial group testing problems.
CoRR, 2017
Search for the end of a path in the d-dimensional grid and in other graphs.
Ars Math. Contemp., 2017
2016
Topological orderings of weighted directed acyclic graphs.
Inf. Process. Lett., 2016
A note on tilted Sperner families with patterns.
Discret. Math., 2016
2015
Finding a majority ball with majority answers.
Electron. Notes Discret. Math., 2015
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets.
Eur. J. Comb., 2015
2014
Advantage in the discrete Voronoi game.
J. Graph Algorithms Appl., 2014
Covering Paths for Planar Point Sets.
Discret. Comput. Geom., 2014
Edge-decomposition of Graphs into Copies of a Tree with Four Edges.
Electron. J. Comb., 2014
Partitioning 2-edge-colored graphs by monochromatic paths and cycles.
Comb., 2014
2013
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets.
Graphs Comb., 2013
Saturating Sperner Families.
Graphs Comb., 2013
The Magnus-Derek game in groups.
Discret. Math. Theor. Comput. Sci., 2013
Majority and plurality problems.
Discret. Appl. Math., 2013
Separating families of convex sets.
Comput. Geom., 2013
Profile polytopes of some classes of families.
Comb., 2013
Density-Based Group Testing.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013
2012
Almost Intersecting Families of Sets.
SIAM J. Discret. Math., 2012
Generalizations of the tree packing conjecture.
Discuss. Math. Graph Theory, 2012
Search for the end of a path in the d-dimensional grid and in other graphs
CoRR, 2012
2011
Path-search in the pyramid and in other graphs
CoRR, 2011
2010
Polychromatic colorings of arbitrary rectangular partitions.
Discret. Math., 2010
Finding the maximum and minimum elements with one lie.
Discret. Appl. Math., 2010
2009
Extremal Combinatorial Problems
PhD thesis, 2009
Profile vectors in the lattice of subspaces.
Discret. Math., 2009
2008
SIAM J. Discret. Math., 2008
2007
Chain Intersecting Families.
Graphs Comb., 2007
