Miklós Simonovits

Miklós Simonovits

Miklós Simonovits (4 September 1943, 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. 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.[1]

References

  1. ^ "Papers of Paul Erdős". http://www.renyi.hu/~p_erdos/. 

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Paul Erdos — Paul Erdős auf einem Seminar in Budapest (Herbst 1992) Paul Erdős [ˈɛrdøːʃ] (ungarisch: Erdős Pál) (* 26. März 1913 in Budapest, Ungarn; † 20. September 1996 in Warschau, Polen) war …   Deutsch Wikipedia

  • Paul Erdös — Paul Erdős auf einem Seminar in Budapest (Herbst 1992) Paul Erdős [ˈɛrdøːʃ] (ungarisch: Erdős Pál) (* 26. März 1913 in Budapest, Ungarn; † 20. September 1996 in Warschau, Polen) war …   Deutsch Wikipedia

  • Combinatorica — is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors in chief with Paul Erdős as honorary editor in chief. The… …   Wikipedia

  • Szemerédi regularity lemma — In mathematics, Szemerédi s regularity lemma states that every large enough (finite undirected simple) graph can be approximated by a composition of a structured and a pseudo random part.Formal statement of the regularity lemmaThe formal… …   Wikipedia

  • Paul Erdős — auf einem Seminar in Budapest (Herbst 1992) Paul Erdős [ˈɛrdøːʃ] (ungarisch Erdős Pál; * 26. März 1913 in Budapest, Österreich Ungarn; † 20. September …   Deutsch Wikipedia

  • Alfréd Rényi Institute of Mathematics — Rényi Alfréd Matematikai Kutatóintézet Established 1950 (1950) Field of Research mathematics Director Péter Pál Pálfy …   Wikipedia

  • Einheitsdistanz-Graph — Der Petersen Graph ist ein Einheitsdistanz Graph: er kann so gezeichnet werden, dass jede Kante gleich lang ist. Ein Einheitsdistanz Graph ist ein geometrischer Graph, bei dem jede Kante gleich lang ist. Kanten eines Einheitsdistanz Graphen… …   Deutsch Wikipedia

  • Paul Erdős — at a student seminar in Budapest (fall 1992) Born 26 March 1913 …   Wikipedia

  • Ralph Faudree — Ralph J. Faudree is a mathematician who specializes in combinatorics; specifically graph theory and Ramsey theory. He has published more than 150 mathematical papers on these topics together with such notable mathematicians as Bela Bollobas,… …   Wikipedia

  • Crown graph — Crown graphs with six, eight, and ten vertices. In graph theory, a branch of mathematics, a crown graph on 2n vertices is an undirected graph with two sets of vertices ui and vi and with an edge from ui to vj whenever i ≠ j. The crown… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”