Search Results - Simonovits, Miklós
Miklós Simonovits
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''(''n''7 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. Provided by Wikipedia
-
1
Chapter On a theorem of Erdős and Simonovits on graphs not containing the cube
Published 2013Other Authors: “…Simonovits, Miklós…”
OAPEN Library: download the publication
OAPEN Library: description of the publication
Electronic Book Chapter -
2
Chapter On the optimal weight function in the Goldston-Pintz-Yıldırım method for finding small gaps between consecutive primes
Published 2013Other Authors: “…Simonovits, Miklós…”
OAPEN Library: download the publication
OAPEN Library: description of the publication
Electronic Book Chapter -
3
Chapter Some new results on gaps between consecutive primes
Published 2013Other Authors: “…Simonovits, Miklós…”
OAPEN Library: download the publication
OAPEN Library: description of the publication
Electronic Book Chapter -
4
Number Theory, Analysis, and Combinatorics: Proceedings of the Paul Turan Memorial Conference held August 22-26, 2011 in Budapest
Published 2013Other Authors: “…Simonovits, Miklós…”
OAPEN Library: description of the publication
Electronic Book Chapter