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.
