Name
Affiliation
Papers
DÁNIEL GERBNER
Alfréd Rényi Institute of Mathematics
57
Collaborators
Citations 
PageRank 
58
46
21.61
Referers 
Referees 
References 
69
260
189
Search Limit
100260
Title
Citations
PageRank
Year
Saturation problems with regularity constraints00.342022
Generalized Turán Problems for Complete Bipartite Graphs00.342022
Hypergraph Based Berge Hypergraphs00.342022
Some exact results for generalized Turan problems00.342022
Unified approach to the generalized Turan problem and supersaturation00.342022
Supersaturation, Counting, And Randomness In Forbidden Subposet Problems00.342021
Hypergraphs without exponents00.342021
Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets00.342021
A Note On The Turan Number Of A Berge Odd Cycle00.342021
$t$-Wise Berge and $t$-Heavy Hypergraphs00.342020
On clique coverings of complete multipartite graphs00.342020
Set systems related to a house allocation problem00.342020
Generalized Turán problems for even cycles30.442020
General lemmas for Berge–Turán hypergraph problems20.422020
Counting copies of a fixed subgraph in $F$-free graphs10.362019
Linearity of saturation for Berge hypergraphs.00.342019
On the Number of Containments in P-free Families.00.342019
Asymptotics for the Turán number of Berge-.10.362019
Asymptotics for the Turán number of Berge-K2,10.362019
On the Weight of Berge-F-Free Hypergraphs.00.342019
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets.00.342019
Majority problems of large query size00.342019
Stability results for vertex Turatn problems in Kneser graphs00.342019
Generalized Turán problems for disjoint copies of graphs40.482019
On the Number of Cycles in a Graph with Restricted Cycle Lengths.20.422018
Line Percolation in Finite Projective Planes.00.342018
Identifying defective sets using queries of small size.00.342018
Forbidden Subposet Problems for Traces of Set Families.00.342018
Smart elements in combinatorial group testing problems.00.342018
Intersecting P-free families.00.342017
Extremal Results for Berge Hypergraphs.10.362017
A plurality problem with three colors and query size three.10.362017
Conscious and controlling elements in combinatorial group testing problems.00.342017
Finding a non-minority ball with majority answers.20.392017
Topological orderings of weighted directed acyclic graphs00.342016
A note on tilted Sperner families with patterns00.342016
Finding a majority ball with majority answers.00.342015
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets.00.342015
Edge-decomposition of Graphs into Copies of a Tree with Four Edges.101.012014
Separating families of convex sets20.462013
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets00.342013
Advantage in the discrete Voronoi game.00.342013
Density-Based group testing10.362013
Profile polytopes of some classes of families.10.402013
The Magnus-Derek game in groups.00.342013
Saturating Sperner Families20.522013
Majority and plurality problems00.342012
Search for the end of a path in the d-dimensional grid and in other graphs00.342012
Almost Intersecting Families of Sets.30.502012
Generalizations of the tree packing conjecture.30.572012
  • 1
  • 2