Miklós Simonovits
Miklós Simonovits | |
|---|---|
| Born | 4 September 1943 |
| Nationality | Hungarian |
| Education | PhD. Eötvös Loránd University, 1971 |
| Occupation | Mathematician |
| Organization(s) | Alfréd Rényi Institute of Mathematics, Budapest |
| Known for | Extremal Graph Theory Extremal Combinatorics |
| Awards | Szele Tibor-emlékérem (1989)
Akadémiai Díj (1993) Széchenyi Prize (2014) |
| Website | http://www.renyi.hu/~miki/ |
Miklós Simonovits (4 September 1943 in Budapest) is a Hungarian mathematician who currently works at the Rényi Institute of Mathematics in Budapest and is a member of the Hungarian Academy of Sciences. He is on the advisory board of the journal Combinatorica. He is best known for his work in extremal graph theory and was awarded Széchenyi Prize in 2014. Among other things, he discovered the method of progressive induction which he used to describe graphs which do not contain a predetermined graph and the number of edges is close to maximal. With Lovász, he gave a randomized algorithm using O(n7 log2 n) separation calls to approximate the volume of a convex body within a fixed relative error.
Simonovits was also one of the most frequent collaborators with Paul Erdős, co-authoring 21 papers with him.