Gábor Kun

420 total citations
23 papers, 181 citations indexed

About

Gábor Kun is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Gábor Kun has authored 23 papers receiving a total of 181 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Computational Theory and Mathematics, 8 papers in Discrete Mathematics and Combinatorics and 7 papers in Geometry and Topology. Recurrent topics in Gábor Kun's work include Advanced Graph Theory Research (11 papers), Limits and Structures in Graph Theory (8 papers) and Complexity and Algorithms in Graphs (6 papers). Gábor Kun is often cited by papers focused on Advanced Graph Theory Research (11 papers), Limits and Structures in Graph Theory (8 papers) and Complexity and Algorithms in Graphs (6 papers). Gábor Kun collaborates with scholars based in Hungary, United States and Germany. Gábor Kun's co-authors include Gerhard Jank, Márió Szegedy, Béla Bollobás, Imre Leader, Jaroslav Nešetřil, Ryan O’Donnell, Yuan Zhou, Yuichi Yoshida, Gábor Lippner and Daniel Dadush and has published in prestigious journals such as Transactions of the American Mathematical Society, Journal of Combinatorial Theory Series B and Israel Journal of Mathematics.

In The Last Decade

Gábor Kun

20 papers receiving 162 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Gábor Kun Hungary 9 124 52 33 32 21 23 181
David C. Kay United States 8 93 0.8× 12 0.2× 17 0.5× 76 2.4× 10 0.5× 22 256
Walter D. Morris United States 8 158 1.3× 12 0.2× 41 1.2× 41 1.3× 18 0.9× 34 241
Daniel A. Marcus United States 6 53 0.4× 21 0.4× 44 1.3× 87 2.7× 57 2.7× 15 253
Xiumin Du United States 6 35 0.3× 33 0.6× 30 0.9× 25 0.8× 37 1.8× 9 212
H. Tracy Hall United States 7 207 1.7× 47 0.9× 50 1.5× 133 4.2× 9 0.4× 20 238
Chinnaraji Annamalai India 8 48 0.4× 26 0.5× 8 0.2× 17 0.5× 16 0.8× 90 214
Yannick Saouter France 9 34 0.3× 63 1.2× 20 0.6× 26 0.8× 34 1.6× 22 169
Hervé Fournier France 8 107 0.9× 19 0.4× 39 1.2× 30 0.9× 48 2.3× 19 153
А. С. Тихомиров Russia 8 27 0.2× 14 0.3× 17 0.5× 100 3.1× 22 1.0× 33 174
Raman Sanyal Germany 8 75 0.6× 5 0.1× 87 2.6× 50 1.6× 8 0.4× 26 168

Countries citing papers authored by Gábor Kun

Since Specialization
Citations

This map shows the geographic impact of Gábor Kun'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 Gábor Kun with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gábor Kun more than expected).

Fields of papers citing papers by Gábor Kun

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gábor Kun. 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 Gábor Kun. The network helps show where Gábor Kun may publish in the future.

Co-authorship network of co-authors of Gábor Kun

This figure shows the co-authorship network connecting the top 25 collaborators of Gábor Kun. A scholar is included among the top collaborators of Gábor Kun 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 Gábor Kun. Gábor Kun 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.
Hladký, Jan, et al.. (2024). On pattern‐avoiding permutons. Random Structures and Algorithms. 65(1). 46–60.
2.
Kun, Gábor, et al.. (2023). A polynomial removal lemma for posets. 695–701. 1 indexed citations
3.
Benjamini, Itaï, et al.. (2022). Expander spanning subgraphs with large girth. Israel Journal of Mathematics. 251(1). 156–172. 1 indexed citations
4.
Kun, Gábor, et al.. (2016). . Theory of Computing. 12(1). 1–34. 2 indexed citations
5.
Dadush, Daniel & Gábor Kun. (2016). . Theory of Computing. 12(1). 1–34. 3 indexed citations
6.
Abért, Miklós, et al.. (2015). Matchings in Benjamini–Schramm convergent graph sequences. Transactions of the American Mathematical Society. 368(6). 4197–4218. 7 indexed citations
7.
Kun, Gábor & Márió Szegedy. (2015). A new line of attack on the dichotomy conjecture. European Journal of Combinatorics. 52. 338–367. 6 indexed citations
8.
Kun, Gábor. (2013). Constraints, MMSNP and expander relational structures. COMBINATORICA. 33(3). 335–347. 13 indexed citations
9.
Bollobás, Béla, Gábor Kun, & Imre Leader. (2012). Cops and robbers in a random graph. Journal of Combinatorial Theory Series B. 103(2). 226–236. 25 indexed citations
10.
Kun, Gábor, et al.. (2012). Linear programming, width-1 CSPs, and robust satisfaction. 484–495. 20 indexed citations
11.
Kun, Gábor & Jaroslav Nešetřil. (2008). Forbidden lifts (NP and CSP for combinatorialists). European Journal of Combinatorics. 29(4). 930–945. 12 indexed citations
12.
Kun, Gábor, et al.. (2007). THE MEMBERSHIP PROBLEM IN FINITE FLAT HYPERGRAPH ALGEBRAS. International Journal of Algebra and Computation. 17(3). 449–459. 9 indexed citations
13.
Kun, Gábor & Jaroslav Nešetřil. (2007). NP for Combinatorialists. Electronic Notes in Discrete Mathematics. 29. 373–381. 1 indexed citations
14.
Kun, Gábor, et al.. (2006). Metric Characterization of Pure Unrectifiability. Real Analysis Exchange. 31(1). 195–195.
15.
Kun, Gábor & Gábor Lippner. (2003). Large empty convex polygons in k-convex sets. Periodica Mathematica Hungarica. 46(1). 81–88. 6 indexed citations
16.
Kun, Gábor, et al.. (2003). Jónsson Terms and Near-Unanimity Functions in Finite Posets. Order. 20(4). 291–298. 2 indexed citations
17.
Jank, Gerhard & Gábor Kun. (2002). Optimal Control of Disturbed Linear-Quadratic Differential Games. European Journal of Control. 8(2). 152–162. 15 indexed citations
18.
Kun, Gábor. (2001). Differential games on Lie groups. 7–12.
19.
Kun, Gábor, et al.. (2001). Order Varieties and Monotone Retractions of Finite Posets. Order. 18(1). 79–88. 12 indexed citations
20.
Kun, Gábor & Gerhard Jank. (2000). Stabilizability, controllability and optimal strategies of linear and nonlinear dynamical games. RWTH Publications (RWTH Aachen). 18 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

Breakdown of academic impact, for papers by David C. Kay Breakdown of academic impact, for papers by Walter D. Morris Breakdown of academic impact, for papers by Daniel A. Marcus Breakdown of academic impact, for papers by Xiumin Du Breakdown of academic impact, for papers by H. Tracy Hall Breakdown of academic impact, for papers by Chinnaraji Annamalai Breakdown of academic impact, for papers by Yannick Saouter Breakdown of academic impact, for papers by Hervé Fournier Breakdown of academic impact, for papers by А. С. Тихомиров Breakdown of academic impact, for papers by Raman Sanyal
Rankless by CCL
2026