András Gyárfás
- Computational Theory and Mathematics top 0.2%
- Discrete Mathematics and Combinatorics top 0.2%
- Geometry and Topology top 1%
- Electrical and Electronic Engineering top 10%
- Computer Networks and Communications top 5%
- Co-authors
- Jenő LehelGábor N. SárközyEndre SzemerédiZs. TuzaR. H. SchelpMiklós RuszinkóPaul ErdősRalph J. Faudree
- Topics
- Limits and Structures in Graph Theory (97 papers)Advanced Graph Theory Research (93 papers)Advanced Topology and Set Theory (36 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Partner nations
- HungaryUnited StatesGermany
In The Last Decade
András Gyárfás
114 papers receiving 1.7k citations
Peers
Comparison fields: 5 of 46
- Computational Theory and Mathematics 1.6k
- Discrete Mathematics and Combinatorics 1.3k
- Geometry and Topology 652
- Electrical and Electronic Engineering 315
- Computer Networks and Communications 183
Countries citing papers authored by András Gyárfás
This map shows the geographic impact of András Gyárfás'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 András Gyárfás with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites András Gyárfás more than expected).
Fields of papers citing papers by András Gyárfás
This network shows the impact of papers produced by András Gyárfás. 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 András Gyárfás. The network helps show where András Gyárfás may publish in the future.
Co-authorship network of co-authors of András Gyárfás
This figure shows the co-authorship network connecting the top 25 collaborators of András Gyárfás. A scholar is included among the top collaborators of András Gyárfás 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 András Gyárfás. András Gyárfás is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 1 | |
| 3 | Ramsey number of a connected triangle matching | 1 |
| 4 | 0 | |
| 5 | 12 | |
| 6 | 7 | |
| 7 | 4 | |
| 8 | 9 | |
| 9 | Ramsey and Turán-type problems for non-crossing subgraphs of bipartite geometric graphs | 0 |
| 10 | Long rainbow cycles in proper edge-colorings of complete graphs | 7 |
| 11 | 2 | |
| 12 | 43 | |
| 13 | 9 | |
| 14 | Path pairable graphs | 6 |
| 15 | Vertex covering with monochromatic paths | 2 |
| 16 | 1 | |
| 17 | Minimal path-pairable graphs | 7 |
| 18 | Irregularity strength of uniform hypergraphs | 4 |
| 19 | 9 | |
| 20 | 61 |
About András Gyárfás
András Gyárfás is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology and Computational Theory and Mathematics, having authored 119 papers that have together received 1.8k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (97 papers), Advanced Graph Theory Research (93 papers) and Advanced Topology and Set Theory (36 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.3k citations), Computational Theory and Mathematics (1.6k citations) and Geometry and Topology (652 citations). András Gyárfás has collaborated with scholars based in Hungary, United States and Germany. Frequent co-authors include Jenő Lehel, Gábor N. Sárközy, Endre Szemerédi, Zs. Tuza, R. H. Schelp, Miklós Ruszinkó, Paul Erdős, Ralph J. Faudree, Péter L. Erdős and L. Pyber. Their work appears in journals such as Networks, Discrete Applied Mathematics and Discrete Mathematics.
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.