World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
38
Citations
5364
World Ranking
2373
National Ranking
14

Overview

András Gyárfás is affiliated with the Alfréd Rényi Institute of Mathematics in Hungary. Their research primarily focuses on Mathematics and Computer Science, with significant contributions to the subfields of Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology, and Computer Graphics and Computer-Aided Design.

The scientist's work covers several key topics that include Limits and Structures in Graph Theory, Advanced Graph Theory Research, graph theory and CDMA systems, Advanced Topology and Set Theory, Graph theory and applications, Graph Labeling and Dimension Problems, and Computational Geometry and Mesh Generation.

Frequent publication venues for András Gyárfás include arXiv (Cornell University), Journal of Graph Theory, Discrete Mathematics, European Journal of Combinatorics, and The Electronic Journal of Combinatorics.

Collaboration is evident through multiple frequent co-authors such as Gábor N. Sárközy, Zoltán Füredi, János Barát, Louis DeBiasio, and Attila Sali.

Their recent influential publications encompass the following:

  • Linear Turán numbers of acyclic triple systems, 2021, European Journal of Combinatorics
  • Distribution of colors in Gallai colorings, 2020, European Journal of Combinatorics
  • Matchings with few colors in colored complete graphs and hypergraphs, 2020, Discrete Mathematics
  • The linear Turán number of small triple systems or why is the wicket interesting?, 2022, Discrete Mathematics
  • Monochromatic spanning trees and matchings in ordered complete graphs, 2023, Journal of Graph Theory

Best Publications

  • Problems from the world surrounding perfect graphs

    András Gyárfás

  • On‐line and first fit colorings of graphs

    András Gyárfás;Jenö Lehel

  • THE STRONG CHROMATIC INDEX OF GRAPHS

    J. Faudree;R. H. Schelp;A. Gyarfas

  • Vertex coverings by Monochromatic cycles and trees

    P. Erdős;A. Gyárfás;L. Pyber

  • Induced matchings in bipartite graphs

    R. Faudree;A. Gyárfas;R. H. Schelp;Z. Tuza

  • Edge colorings of complete graphs without tricolored triangles

    András Gyárfás;Gábor Simony

  • Edge colorings of complete graphs without tricolored triangles: EDGE COLORING WITHOUT TRICOLORED TRIANGLES

    András Gyárfás;Gábor Simonyi

  • The maximum number of edges in 2 K 2 -free graphs of bounded degree

    F. R. K. Chung;A. Gyárfás;Z. Tuza;W. T. Trotter

  • On the chromatic number of multiple interval graphs and overlap graphs

    András Gyárfás

  • Three-color Ramsey numbers for paths

    András Gyárfás;Miklós Ruszinkó;Gábor N. Sárközy;Endre Szemerédi

  • Covering and coloring problems for relatives of intervals

    András Gyárfás;Jenö Lehel

  • Three-Color Ramsey Numbers For Paths

    Unknown

  • A variant of the classical Ramsey problem

    Paul Erdős;András Gyárfás

  • Coloring the Maximal Cliques of Graphs

    Gábor Bacsó;Sylvain Gravier;András Gyárfás;Myriam Preissmann

  • An improved bound for the monochromatic cycle partition number

    András Gyárfás;Miklós Ruszinkó;Gábor N. Sárközy;Endre Szemerédi

  • Induced subtrees in graphs of large chromatic number

    A. Gyárfás;E. Szemeredi;Zs. Tuza

  • A Ramsey-type problem in directed and bipartite graphs

    A. Gyárfás;J. Lehel

  • Ramsey-type results for Gallai colorings

    András Gyárfás;Gábor N. Sárközy;András Sebő;Stanley Selkow

  • Vertex coverings by monochromatic paths and cycles

    András Gyárfás

  • Ramsey numbers for local colorings

    A. Gyárfás;J. Lehel;R. H. Schelp;Zs. Tuza

  • On the irregularity strength of the m x n grid

    Jeffrey H. Dinitz;David K. Garnick;Andras Gyárfás

Frequent Co-Authors

Endre Szemerédi
Endre Szemerédi Alfréd Rényi Institute of Mathematics
Zoltán Füredi
Zoltán Füredi University of Illinois at Urbana-Champaign
Zsolt Tuza
Zsolt Tuza University of Pannonia
Béla Bollobás
Béla Bollobás University of Memphis
Paul Erdös
Paul Erdös Hungarian Academy of Sciences
Miklós Simonovits
Miklós Simonovits Alfréd Rényi Institute of Mathematics
Tomasz Łuczak
Tomasz Łuczak Adam Mickiewicz University in Poznań
Noga Alon
Noga Alon Tel Aviv University
Dhruv Mubayi
Dhruv Mubayi University of Illinois at Chicago
Dieter Kratsch
Dieter Kratsch University of Lorraine

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in expanding their expertise beyond Mathematics, pursuing related online degrees can open diverse career pathways. For example, MBA programs offer a blend of analytical skills and business acumen. Exploring the easiest mba specialization could be a practical choice for those seeking accessible graduate business education.

Many institutions offer easy online mba programs that allow flexibility while providing foundational management skills. These programs complement mathematical expertise, preparing graduates for leadership roles in finance, analytics, and technology sectors.

For professionals aiming to advance in executive-level research or consulting, dba programs (Doctor of Business Administration) serve as a rigorous yet affordable option. This degree emphasizes strategic decision-making and advanced business theory, ideal for math graduates targeting high-level roles.

Additionally, the financial sector offers numerous opportunities for math specialists, particularly with the rise of quantitative finance. The cheapest masters in finance can be a cost-effective path to gain specialized knowledge in financial modeling, risk management, and investment strategies.

Choosing the right online degree allows mathematics students to diversify their skills and increase their employability in competitive job markets.

Best Scientists Citing András Gyárfás

Trending Scientists

Recently Published Articles