Miklós Simonovits
Hungarian mathematician
Miklós Simonovits's AcademicInfluence.com Rankings
Download Badge
Mathematics
Miklós Simonovits's Degrees
- PhD Mathematics Eötvös Loránd University
Why Is Miklós Simonovits Influential?
(Suggest an Edit or Addition)According to Wikipedia, Miklós Simonovits 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 separation calls to approximate the volume of a convex body within a fixed relative error.
Miklós Simonovits's Published Works
Published Works
- Szemeredi''s Regularity Lemma and its applications in graph theory (1995) (597)
- Random Walks in a Convex Body and an Improved Volume Algorithm (1993) (454)
- Isoperimetric problems for convex bodies and a localization lemma (1995) (444)
- Cycles of even length in graphs (1974) (381)
- The History of Degenerate (Bipartite) Extremal Graph Problems (2013) (304)
- Random walks and an O * ( n 5 ) volume algorithm for convex bodies (1997) (259)
- Supersaturated graphs and hypergraphs (1983) (243)
- The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume (1990) (239)
- Random walks and an O*(n5) volume algorithm for convex bodies (1997) (231)
- The Regularity Lemma and Its Applications in Graph Theory (2000) (168)
- Compactness results in extremal graph theory (1982) (141)
- On the number of complete subgraphs of a graph II (1983) (129)
- On a valence problem in extremal graph theory (1973) (96)
- Triple Systems Not Containing a Fano Configuration (2005) (94)
- On a class of degenerate extremal graph problems (1983) (91)
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions (1974) (90)
- Ramsey-Turán theory (2001) (80)
- The number of graphs without forbidden subgraphs (2004) (70)
- On the randomized complexity of volume and diameter (1992) (66)
- Extremal problems for directed graphs (1973) (66)
- Extremal Graph Problems , Degenerate Extremal Problems , and Supersaturated Graphs (2010) (65)
- The 3-colored Ramsey number of odd cycles (2005) (60)
- How to compute the volume in high dimension? (2003) (60)
- Szemerédi's Partition and Quasirandomness (1991) (60)
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs (1997) (60)
- The typical structure of graphs without given excluded subgraphs (2009) (57)
- The Ramsey number for hypergraph cycles I (2006) (57)
- Extremal Graphs without Large Forbidden Subgraphs (1978) (53)
- Deterministic and randomized polynomial-time approximation of radii (2001) (51)
- On the maximal number of certain subgraphs inKr-free graphs (1991) (50)
- On restricted colourings ofKn (1984) (49)
- On Triple Systems with Independent Neighbourhoods (2005) (49)
- Some extremal problems in graph theory (2004) (48)
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures (1984) (47)
- ON THE CHROMATIC NUMBER OF GEOMETRIC GRAPHS (1980) (47)
- On the structure of edge graphs ii (1976) (47)
- Cube-Supersaturated Graphs and Related Problems (1982) (46)
- A note on paradoxical metric spaces (1995) (44)
- Paul Erdős' Influence on Extremal Graph Theory (2013) (36)
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits (1967) (36)
- Algorithmic solution of extremal digraph problems (1985) (35)
- The Tura'n Density of the Hypergraph {abc, ade, bde, cde} (2003) (35)
- Approximation of diameters: randomization doesn't help (1998) (35)
- Spanning retracts of a partially ordered set (1980) (31)
- The fine structure of octahedron-free graphs (2011) (31)
- The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result (2014) (30)
- The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs (2014) (28)
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs (2003) (28)
- The coloring numbers of the direct product of two hypergraphs (1974) (28)
- The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs (2014) (27)
- The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition (2014) (27)
- Extremal subgraphs of random graphs (1990) (26)
- Turán-Ramsey theorems and simple asymptotically extremal structures (1993) (26)
- On the multi‐colored Ramsey numbers of cycles (2010) (26)
- Turán-Ramsey Theorems and Kp-Independence Numbers (1994) (24)
- An extremal graph problem (1972) (23)
- Intersection Theorems on Structures (1980) (23)
- INVERSE EXTREMAL DIGRAPH PROBLEMS (1984) (21)
- Extremal graphs with bounded densities of small subgraphs (1998) (20)
- Paul Erdős and his mathematics (2002) (18)
- Extremal graph problems and graph products (1983) (17)
- THE APPROXIMATE LOEBL-KOMLOS-SOS CONJECTURE AND EMBEDDING TREES IN SPARSE GRAPHS (2014) (17)
- How to solve a Turán type extremal graph problem? (Linear decomposition) (1997) (17)
- A Note on the Intersection Properties of Subsets of Integers (1980) (15)
- 4-Books of three pages (2006) (14)
- Phase transitions in Ramsey-Turán theory (2013) (12)
- A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? (2009) (12)
- Shifted products that are coprime pure powers (2005) (9)
- Ramsey problems and their connection to tuŕan-type extremal problems (1992) (9)
- On paul turán's influence on graph theory (1977) (7)
- The approximate Loebl-Koml\'os-S\'os Conjecture (2012) (6)
- Intersection Properties of Subsets of Integers (1981) (6)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (2019) (6)
- On $3$-uniform hypergraphs without linear cycles (2014) (5)
- Note on a hypergraph extremal problem (1974) (4)
- Paul Turán’s influence in combinatorics (2013) (3)
- Combinatorics, Geometry and Probability: Turán–Ramsey Theorems and Kp -Independence Numbers (1997) (2)
- A note on Ramsey size‐linear graphs (2002) (2)
- Number Theory, Analysis, and Combinatorics: Proceedings of the Paul Turan Memorial Conference held August 22-26, 2011 in Budapest (2013) (2)
- Intersection Theorems for t-Valued Functions (1988) (2)
- ALGORITHM FOR CONVEX BODIES (1999) (1)
- EXTREMALGRAPH PROBLEMS WITHSYMMETRICAL EXTREMAL GRAPHS. ADDITIONAL CHROMATICCONDITIONS (1974) (1)
- On the minimum degree forcing F-free graphs to be (nearly) bipartite (2008) (1)
- On a Problem of Hirschhorn (1976) (1)
- A note on Ramsey size-linear graphs (2002) (1)
- Phase transitions in the Ramsey-Tur\'an theory (2013) (0)
- COLLOQUIA MATHEMATICA SOCIETATIS JÁNOS BOLYAI 4 . COMBINATORIAL THEORY AND ITS APPLICATIONS (1969) (0)
- A NOTE ON PARADOXICAL METRIC SPACES (ANNOTATED VERSION, 2004) (2004) (0)
- ALGORITHMIC SOLUTION OF EXTREMAL DIGRAPH PROBLEMS1 (1985) (0)
- A hierarchy of randomness for graphs (2005) (0)
- Paul Turán – A Capsule Biography (2013) (0)
- Gyuri Elekes and the incidences (2015) (0)
- Phase transitions in RamseyTurán theory (2015) (0)
- Diszkrét matematika = Discrete mathematics (2009) (0)
- Extremal graph theory, Stability, and Anti-Ramsey theorems (2018) (0)
- Paul Erdős: The Man and the Mathematician (1913–1996) (2001) (0)
- Different levels of randomness in Random Ramsey theorems (2003) (0)
- List of contributing authors (2013) (0)
This paper list is powered by the following services:
Other Resources About Miklós Simonovits
What Schools Are Affiliated With Miklós Simonovits?
Miklós Simonovits is affiliated with the following schools: