Dániel Gerbner

979 total citations
67 papers, 375 citations indexed

About

Dániel Gerbner is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Dániel Gerbner has authored 67 papers receiving a total of 375 indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Discrete Mathematics and Combinatorics, 46 papers in Computational Theory and Mathematics and 36 papers in Geometry and Topology. Recurrent topics in Dániel Gerbner's work include Limits and Structures in Graph Theory (53 papers), Advanced Graph Theory Research (40 papers) and Graph theory and applications (29 papers). Dániel Gerbner is often cited by papers focused on Limits and Structures in Graph Theory (53 papers), Advanced Graph Theory Research (40 papers) and Graph theory and applications (29 papers). Dániel Gerbner collaborates with scholars based in Hungary, United States and Switzerland. Dániel Gerbner's co-authors include Cory Palmer, Balázs Patkós, Abhishek Methuku, Máté Vizer, János Barát, Dömötör Pálvölgyi, Ervin Győri, Balázs Keszegh, Nathan Lemons and András Gyárfás and has published in prestigious journals such as SHILAP Revista de lepidopterología, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Dániel Gerbner

54 papers receiving 353 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Dániel Gerbner Hungary 10 324 282 219 37 14 67 375
Yuejian Peng China 11 327 1.0× 311 1.1× 248 1.1× 53 1.4× 8 0.6× 73 377
Jozef Skokan United States 13 429 1.3× 376 1.3× 274 1.3× 68 1.8× 8 0.6× 32 476
Brendan Nagle United States 11 405 1.3× 342 1.2× 240 1.1× 65 1.8× 10 0.7× 31 430
Balázs Patkós Hungary 9 204 0.6× 176 0.6× 145 0.7× 51 1.4× 17 1.2× 59 276
Alexander Soifer United States 6 176 0.5× 151 0.5× 121 0.6× 48 1.3× 12 0.9× 30 273
Andrew Treglown United Kingdom 11 344 1.1× 295 1.0× 164 0.7× 133 3.6× 16 1.1× 44 378
Norihide Tokushige Japan 13 421 1.3× 328 1.2× 223 1.0× 134 3.6× 17 1.2× 66 501
Cheng Yeaw Ku Singapore 11 313 1.0× 130 0.5× 202 0.9× 117 3.2× 20 1.4× 41 360
David Conlon United States 18 638 2.0× 589 2.1× 457 2.1× 59 1.6× 25 1.8× 64 723
D. A. Shabanov Russia 10 224 0.7× 173 0.6× 121 0.6× 59 1.6× 20 1.4× 60 273

Countries citing papers authored by Dániel Gerbner

Since Specialization
Citations

This map shows the geographic impact of Dániel Gerbner's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dániel Gerbner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dániel Gerbner more than expected).

Fields of papers citing papers by Dániel Gerbner

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dániel Gerbner. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dániel Gerbner. The network helps show where Dániel Gerbner may publish in the future.

Co-authorship network of co-authors of Dániel Gerbner

This figure shows the co-authorship network connecting the top 25 collaborators of Dániel Gerbner. A scholar is included among the top collaborators of Dániel Gerbner based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dániel Gerbner. Dániel Gerbner is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gerbner, Dániel. (2025). On degree powers and counting stars in F-free graphs. European Journal of Combinatorics. 126. 104135–104135.
2.
Gerbner, Dániel. (2024). On non-degenerate Turán problems for expansions. European Journal of Combinatorics. 124. 104071–104071. 1 indexed citations
3.
Gerbner, Dániel. (2024). Generalized Turán results for disjoint cliques. Discrete Mathematics. 347(7). 114024–114024. 1 indexed citations
4.
Gerbner, Dániel, et al.. (2024). Directed Graphs Without Rainbow Stars. The Electronic Journal of Combinatorics. 31(4). 1 indexed citations
5.
Gerbner, Dániel, et al.. (2023). Turán problems for edge-ordered graphs. Journal of Combinatorial Theory Series B. 160. 66–113. 4 indexed citations
6.
Gerbner, Dániel. (2023). Generalized Turán problems for $K_{2,t}$. The Electronic Journal of Combinatorics. 30(1).
7.
Gerbner, Dániel. (2023). Some Stability and Exact Results in Generalized Turán Problems. Studia Scientiarum Mathematicarum Hungarica. 60(1). 16–26.
8.
Gerbner, Dániel. (2023). Paths are Turán-good. Graphs and Combinatorics. 39(3). 1 indexed citations
9.
Gerbner, Dániel. (2023). A Non-aligning Variant of Generalized Turán Problems. Annals of Combinatorics. 28(2). 351–366. 1 indexed citations
10.
Gerbner, Dániel. (2023). Some Exact Results for Non-Degenerate Generalized Turán Problems. The Electronic Journal of Combinatorics. 30(4). 3 indexed citations
11.
Gerbner, Dániel. (2023). The covering lemma and q-analogues of extremal set theory problems. Ars Mathematica Contemporanea. 24(1). #P1.07–#P1.07. 1 indexed citations
12.
Gerbner, Dániel. (2022). A Note on the Number of Triangles in Graphs Without the Suspension of a Path on Four Vertices. SHILAP Revista de lepidopterología. 10. 32–34.
13.
Gerbner, Dániel, et al.. (2019). Edge ordered Turán problems. Repository of the Academy's Library (Library of the Hungarian Academy of Sciences). 88(3). 717–722. 1 indexed citations
14.
Gerbner, Dániel, Abhishek Methuku, & Máté Vizer. (2019). Asymptotics for the Turán number of Berge-K2,. Journal of Combinatorial Theory Series B. 137. 264–290. 16 indexed citations
15.
Gerbner, Dániel, et al.. (2017). Identifying defective sets using queries of small size. Discrete Mathematics. 341(1). 143–150.
16.
Füredi, Zoltán, Dániel Gerbner, & Máté Vizer. (2015). A discrete isodiametric result: The Erdős–Ko–Rado theorem for multisets. European Journal of Combinatorics. 48. 224–233. 4 indexed citations
17.
Gerbner, Dániel & Gézá Tóth. (2013). Separating families of convex sets. Computational Geometry. 46(9). 1056–1058.
18.
Gerbner, Dániel, Gyula O. H. Katona, Dömötör Pálvölgyi, & Balázs Patkós. (2012). Majority and plurality problems. Discrete Applied Mathematics. 161(6). 813–818. 3 indexed citations
19.
Gerbner, Dániel, et al.. (2010). Finding the maximum and minimum elements with one lie. Discrete Applied Mathematics. 158(9). 988–995.
20.
Gerbner, Dániel, et al.. (2009). Polychromatic colorings of arbitrary rectangular partitions. Discrete Mathematics. 310(1). 21–30. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026