András Gyárfás (born 1945) is a Hungarian mathematician who specializes in the study of graph theory. He is famous for two conjectures: * Together with

Paul Erdős Paul Erdős ( hu, Erdős Pál ; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. pursued and proposed problems in ...

he conjectured what is now called the Erdős–Gyárfás conjecture which states that any graph with minimum

degree Degree may refer to: As a unit of measurement * Degree (angle), a unit of angle measurement ** Degree of geographical latitude ** Degree of geographical longitude * Degree symbol (°), a notation used in science, engineering, and mathematics ...

3 contains a

simple cycle In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail in which only the first and last vertices are equal. A graph witho ...

whose length is a power of two. * He and

David Sumner David P. Sumner is an American mathematician known for his research in graph theory. He formulated Sumner's conjecture that tournaments are universal graphs for polytrees in 1971, and showed in 1974 that all claw-free graphs with an even number of ...

independently formulated the

Gyárfás–Sumner conjecture In graph theory, the Gyárfás–Sumner conjecture asks whether, for every tree T and complete graph K, the graphs with neither T nor K as induced subgraphs can be properly colored using only a constant number of colors. Equivalently, it asks whet ...

according to which, for every tree ''T'', the ''T''-free graphs are χ-bounded. Gyárfás began working as a researcher for the Computer and Automation Research Institute of the

Hungarian Academy of Sciences The Hungarian Academy of Sciences ( hu, Magyar Tudományos Akadémia, MTA) is the most important and prestigious learned society of Hungary. Its seat is at the bank of the Danube in Budapest, between Széchenyi rakpart and Akadémia utca. Its ma ...

in 1968. He earned a

candidate degree Candidate of Philosophy can refer to the US degree or status of Candidate in Philosophy (C.Phil. or Ph.C.) granted to Ph.D. students who have been accepted as candidates for that degree, or (as a direct translation) to degrees or former degrees at ...

in 1980, and a doctorate (Dr. Math. Sci.) in 1992. He won the Géza Grünwald Commemorative Prize for young researchers of the János Bolyai Mathematical Society in 1978. He was co-author with Paul Erdős on 15 papers, and thus has Erdős number one.

References

External links

András Gyárfás
at the Computer and Automation Research Institute,

Google scholar profile
20th-century Hungarian mathematicians 21st-century Hungarian mathematicians 1945 births Combinatorialists Living people {{Europe-mathematician-stub