D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 31 Citations 3,837 159 World Ranking 7959 National Ranking 9
Mathematics D-index 31 Citations 4,188 160 World Ranking 2046 National Ranking 11

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Graph theory
  • Discrete mathematics

Combinatorics, Discrete mathematics, Edge coloring, Monochromatic color and Cograph are his primary areas of study. His work in Ramsey's theorem, Bipartite graph, Line graph, Complete bipartite graph and Pancyclic graph are all subfields of Combinatorics research. All of his Discrete mathematics and Split graph, Chordal graph, Graph, Vertex and Induced subgraph investigations are sub-components of the entire Discrete mathematics study.

His biological study spans a wide range of topics, including Indifference graph and Graph coloring. András Gyárfás focuses mostly in the field of Edge coloring, narrowing it down to topics relating to List coloring and, in certain cases, Complement graph, Complete coloring and Greedy coloring. András Gyárfás works mostly in the field of Cograph, limiting it down to concerns involving Comparability graph and, occasionally, Triangle-free graph, Robertson–Seymour theorem, Universal graph and Kneser graph.

His most cited work include:

  • Problems from the world surrounding perfect graphs (285 citations)
  • On‐line and first fit colorings of graphs (161 citations)
  • Vertex coverings by Monochromatic cycles and trees (126 citations)

What are the main themes of his work throughout his whole career to date?

András Gyárfás focuses on Combinatorics, Discrete mathematics, Graph, Monochromatic color and Hypergraph. His Ramsey's theorem, Conjecture, Vertex, Edge coloring and Vertex study are his primary interests in Combinatorics. His research integrates issues of Path, Fano plane and Integer in his study of Ramsey's theorem.

His Discrete mathematics study frequently involves adjacent topics like Graph theory. His work on Graph is being expanded to include thematically relevant topics such as Chromatic scale. András Gyárfás works mostly in the field of Chordal graph, limiting it down to topics relating to Indifference graph and, in certain cases, Interval graph, as a part of the same area of interest.

He most often published in these fields:

  • Combinatorics (96.91%)
  • Discrete mathematics (64.95%)
  • Graph (24.23%)

What were the highlights of his more recent work (between 2015-2021)?

  • Combinatorics (96.91%)
  • Discrete mathematics (64.95%)
  • Ramsey's theorem (17.53%)

In recent papers he was focusing on the following fields of study:

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Ramsey's theorem, Vertex and Hypergraph. András Gyárfás combines Combinatorics and Monochromatic color in his research. Edge coloring, Induced subgraph, Ramsey theory, List coloring and Complement graph are subfields of Discrete mathematics in which his conducts study.

His study in Induced subgraph is interdisciplinary in nature, drawing from both Complete coloring, Fractional coloring, Greedy coloring, Graph coloring and Induced path. His biological study deals with issues like Vertex, which deal with fields such as Bijection, Diagonal and Square. In his study, Digraph is strongly linked to Conjecture, which falls under the umbrella field of Complete graph.

Between 2015 and 2021, his most popular works were:

  • Vertex covers by monochromatic pieces - A survey of results and problems (23 citations)
  • Rainbow matchings in bipartite multigraphs (20 citations)
  • Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition (8 citations)

In his most recent research, the most cited papers focused on:

  • Combinatorics
  • Graph theory
  • Geometry

His primary areas of study are Combinatorics, Discrete mathematics, Graph, Vertex and Ramsey's theorem. Within one scientific family, András Gyárfás focuses on topics pertaining to Triple system under Combinatorics, and may sometimes address concerns connected to Partition. His Graph coloring, Induced path, Greedy coloring, Edge coloring and Complete coloring investigations are all subjects of Discrete mathematics research.

The Vertex study combines topics in areas such as Hypergraph and Bijection. His research in Integer intersects with topics in Multigraph and Bipartite graph. The various areas that András Gyárfás examines in his Colored graph study include Conjecture, Complete graph, Connected component and Spanning subgraph.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Problems from the world surrounding perfect graphs

András Gyárfás.
Applicationes Mathematicae (1987)

285 Citations

On‐line and first fit colorings of graphs

András Gyárfás;Jenö Lehel.
Journal of Graph Theory (1988)

249 Citations

THE STRONG CHROMATIC INDEX OF GRAPHS

J. Faudree;R. H. Schelp;A. Gyarfas.
(1990)

185 Citations

Induced matchings in bipartite graphs

R. Faudree;A. Gyárfas;R. H. Schelp;Z. Tuza.
Discrete Mathematics (1989)

144 Citations

Vertex coverings by Monochromatic cycles and trees

P. Erdős;A. Gyárfás;L. Pyber.
Journal of Combinatorial Theory, Series B (1991)

137 Citations

Edge colorings of complete graphs without tricolored triangles

András Gyárfás;Gábor Simony.
Journal of Graph Theory (2004)

124 Citations

Three-color Ramsey numbers for paths

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

116 Citations

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.
Discrete Mathematics (1990)

104 Citations

Covering and coloring problems for relatives of intervals

András Gyárfás;Jenö Lehel.
Discrete Mathematics (1985)

99 Citations

On the chromatic number of multiple interval graphs and overlap graphs

András Gyárfás.
Discrete Mathematics (1985)

94 Citations

Best Scientists Citing András Gyárfás

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 50

Maria Chudnovsky

Maria Chudnovsky

Princeton University

Publications: 37

Paul Seymour

Paul Seymour

Princeton University

Publications: 33

János Pach

János Pach

Alfréd Rényi Institute of Mathematics

Publications: 30

Jacob Fox

Jacob Fox

Stanford University

Publications: 27

Noga Alon

Noga Alon

Tel Aviv University

Publications: 21

Gábor Tardos

Gábor Tardos

Alfréd Rényi Institute of Mathematics

Publications: 19

Alexandr V. Kostochka

Alexandr V. Kostochka

University of Illinois at Urbana-Champaign

Publications: 19

Zsolt Tuza

Zsolt Tuza

University of Pannonia

Publications: 17

Leah Epstein

Leah Epstein

University of Haifa

Publications: 14

Tomasz Łuczak

Tomasz Łuczak

Adam Mickiewicz University in Poznań

Publications: 12

Andrzej Ruciński

Andrzej Ruciński

Adam Mickiewicz University in Poznań

Publications: 12

Zoltán Füredi

Zoltán Füredi

University of Illinois at Urbana-Champaign

Publications: 11

Douglas B. West

Douglas B. West

University of Illinois at Urbana-Champaign

Publications: 10

William T. Trotter

William T. Trotter

Georgia Institute of Technology

Publications: 10

Magnús M. Halldórsson

Magnús M. Halldórsson

Reykjavík University

Publications: 8

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us
Something went wrong. Please try again later.