László Lovász
From Wikipedia, the free encyclopedia
László Lovász (born March 9, 1948 in Budapest, Hungary) is a mathematician, known for work in combinatorics, for which he was in 1999 awarded a Wolf Prize.
Lovász received his Ph.D. in 1970 at Eötvös Loránd University. His advisor was Tibor Gallai. Professor at University of Szeged.
Lovász was a professor at Yale University during the 1990s. He is now a collaborative member of the Microsoft Research Center.
He will be the President of the International Mathematical Union from January 1, 2007[1].
[edit] References
[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
[edit] External links
 |
This article about a mathematician is a stub. You can help Wikipedia by expanding it. |
