András Gyárfás

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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:

Gyárfás began working as a researcher for the Computer and Automation Research Institute of the Hungarian Academy of Sciences in 1968. He earned a candidate degree 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.[1][2]

References[edit]

  1. ^ Gyárfás's CV, retrieved 2016-07-12.
  2. ^ "Non-math in Hungarian". www.renyi.hu. Retrieved 2020-12-16.

External links[edit]