László Lovász
From Wikipedia, the free encyclopedia
László Lovász (born March 9,1948 in Budapest, Hungary) (pronounced [ˈlaːsloː ˈlovaːs]) is a mathematician, best known for his work in combinatorics, for which he was awarded the Wolf Prize and the Knuth Prize in 1999.
Lovász received his Ph.D. in 1970 at Eötvös Loránd University. His advisor was Tibor Gallai.[1]
Lovász was a professor at Yale University during the 1990s and was a collaborative member of the Microsoft Research Center until 2006. Now he has returned to Eötvös Loránd University, Budapest, where he is the director of the Mathematical Institute.
He has served as president of the International Mathematical Union since January 1, 2007[2].
Lovász was awarded the Bolyai prize in 2007.
He has an Erdős number of 1.
[edit] See also
- Lovász conjecture
- Erdős–Faber–Lovász conjecture
- Lovász local lemma
- Lenstra-Lenstra-Lovász lattice reduction algorithm
- Perfect graph theorem
- Greedoid
- Bell number
[edit] References
[edit] External links
es:László Lovász fr:László Lovász hu:Lovász László pl:László Lovász fi:László Lovász

