Gábor N. Sárközy
- Discrete Mathematics and Combinatorics top 0.2%
- Computational Theory and Mathematics top 0.5%
- Geometry and Topology top 1%
- Electrical and Electronic Engineering
- Artificial Intelligence
- Co-authors
- Endre SzemerédiJános KomlósAndrás GyárfásStanley M. SelkowMiklós RuszinkóAndrás SeböH. A. KiersteadR. H. Schelp
- Topics
- Limits and Structures in Graph Theory (72 papers)Advanced Graph Theory Research (58 papers)Advanced Topology and Set Theory (20 papers)
- Cited by
- Discrete Mathematics and CombinatoricsGeometry and TopologyComputational Theory and Mathematics
- Journals
- Proceedings of the VLDB EndowmentDiscrete MathematicsJournal of Combinatorial Theory Series B
- Partner nations
- United StatesHungaryFrance
In The Last Decade
Gábor N. Sárközy
74 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 52
- Discrete Mathematics and Combinatorics 1.0k
- Computational Theory and Mathematics 982
- Geometry and Topology 539
- Electrical and Electronic Engineering 220
- Artificial Intelligence 46
Countries citing papers authored by Gábor N. Sárközy
This map shows the geographic impact of Gábor N. Sárközy'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 N. Sárközy 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 N. Sárközy more than expected).
Fields of papers citing papers by Gábor N. Sárközy
This network shows the impact of papers produced by Gábor N. Sárközy. 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 N. Sárközy. The network helps show where Gábor N. Sárközy may publish in the future.
Co-authorship network of co-authors of Gábor N. Sárközy
This figure shows the co-authorship network connecting the top 25 collaborators of Gábor N. Sárközy. A scholar is included among the top collaborators of Gábor N. Sárközy 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 N. Sárközy. Gábor N. Sárközy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | Ramsey number of a connected triangle matching | 1 |
| 3 | 0 | |
| 4 | 3 | |
| 5 | 5 | |
| 6 | 7 | |
| 7 | Applying Clustering to the Problem of Predicting Retention within an ITS: Comparing Regularity Clustering with Traditional Methods. | 1 |
| 8 | Long rainbow cycles in proper edge-colorings of complete graphs | 7 |
| 9 | 4 | |
| 10 | 10 | |
| 11 | 24 | |
| 12 | 43 | |
| 13 | 12 | |
| 14 | On a question of Gowers concerning isosceles right-angle triangles | 3 |
| 15 | On bipartite generalized Ramsey theory. | 2 |
| 16 | 77 | |
| 17 | 11 | |
| 18 | 8 | |
| 19 | On the Pósa-Seymour conjecture | 20 |
| 20 | 143 |
About Gábor N. Sárközy
Gábor N. Sárközy is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 81 papers that have together received 1.2k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (72 papers), Advanced Graph Theory Research (58 papers) and Advanced Topology and Set Theory (20 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.0k citations), Geometry and Topology (539 citations) and Computational Theory and Mathematics (982 citations). Gábor N. Sárközy has collaborated with scholars based in United States, Hungary and France. Frequent co-authors include Endre Szemerédi, János Komlós, András Gyárfás, Stanley M. Selkow, Miklós Ruszinkó, András Sebö, H. A. Kierstead, R. H. Schelp, János Barát and Zachary A. Pardos. Their work appears in journals such as Proceedings of the VLDB Endowment, Discrete Mathematics and Journal of Combinatorial Theory Series B.
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.