Miklós Simonovits

Publication Activity (10 Years)

Years Active: 1973-2017
Publications (10 Years): 4

Top Topics

Phase Transition

Complex Structures

Top Venues

SIAM J. Discret. Math.

J. Graph Theory

J. Comb. Theory, Ser. B

Publications

Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. SIAM J. Discret. Math. 31 (2) (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. SIAM J. Discret. Math. 31 (2) (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. SIAM J. Discret. Math. 31 (2) (2017)
József Balogh, Ping Hu, Miklós Simonovits
Phase transitions in Ramsey-Turán theory. J. Comb. Theory, Ser. B 114 (2015)
Tomasz Luczak, Miklós Simonovits, Jozef Skokan
On the multi-colored Ramsey numbers of cycles. J. Graph Theory 69 (2) (2012)
József Balogh, Béla Bollobás, Miklós Simonovits
The fine structure of octahedron-free graphs. J. Comb. Theory, Ser. B 101 (2) (2011)
György Elekes, Miklós Simonovits, Endre Szabó
A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? Comb. Probab. Comput. 18 (5) (2009)
József Balogh, Béla Bollobás, Miklós Simonovits
The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms 34 (3) (2009)
Tomasz Luczak, Miklós Simonovits
On the minimum degree forcing F-free graphs to be (nearly) bipartite. Discret. Math. 308 (17) (2008)
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan
The Ramsey number for hypergraph cycles I. J. Comb. Theory, Ser. A 113 (1) (2006)
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
4-Books of three pages. J. Comb. Theory, Ser. A 113 (5) (2006)
Zoltán Füredi, Miklós Simonovits
Triple Systems Not Containing a Fano Configuration. Comb. Probab. Comput. 14 (4) (2005)
Miklós Simonovits, Vera T. Sós
A hierarchy of randomness for graphs. Discret. Math. 303 (1-3) (2005)
Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan
The 3-colored Ramsey number of odd cycles. Electron. Notes Discret. Math. 19 (2005)
Rainer Dietmann, Christian Elsholtz, Katalin Gyarmati, Miklós Simonovits
Shifted products that are coprime pure powers. J. Comb. Theory, Ser. A 111 (1) (2005)
József Balogh, Béla Bollobás, Miklós Simonovits
The number of graphs without forbidden subgraphs. J. Comb. Theory, Ser. B 91 (1) (2004)
Miklós Simonovits, Vera T. Sós
Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs. Comb. Probab. Comput. 12 (3) (2003)
Miklós Simonovits, Vera T. Sós
Different levels of randomness in Random Ramsey theorems. Electron. Notes Discret. Math. 15 (2003)
Miklós Simonovits
How to compute the volume in high dimension? Math. Program. 97 (1-2) (2003)
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. Electron. J. Comb. 10 (2003)
Paul N. Balister, Richard H. Schelp, Miklós Simonovits
A note on Ramsey size-linear graphs. J. Graph Theory 39 (1) (2002)
Miklós Simonovits, Vera T. Sós
Ramsey-Turán theory. Discret. Math. 229 (1-3) (2001)
János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi
The Regularity Lemma and Its Applications in Graph Theory. Theoretical Aspects of Computer Science (2000)
Jerrold R. Griggs, Miklós Simonovits, George Rubin Thomas
Extremal graphs with bounded densities of small subgraphs. J. Graph Theory 29 (3) (1998)
Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits
Approximation of Diameters: Randomization Doesn't Help. FOCS (1998)
Miklós Simonovits
How to solve a Turán type extremal graph problem? (Linear decomposition). Contemporary Trends in Discrete Mathematics (1997)
Miklós Simonovits, Vera T. Sós
Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs. Comb. 17 (4) (1997)
Ravi Kannan, László Lovász, Miklós Simonovits
) volume algorithm for convex bodies. Random Struct. Algorithms 11 (1) (1997)
Ravi Kannan, László Lovász, Miklós Simonovits
Isoperimetric Problems for Convex Bodies and a Localization Lemama. Discret. Comput. Geom. 13 (1995)
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
-Independence Numbers. Comb. Probab. Comput. 3 (1994)
László Lovász, Miklós Simonovits
Random Walks in a Convex Body and an Improved Volume Algorithm. Random Struct. Algorithms 4 (4) (1993)
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
Turán-Ramsey theorems and simple asymptotically extremal structures. Comb. 13 (1) (1993)
Ralph J. Faudree, Miklós Simonovits
Ramsey problems and their connection to tuŕan-type extremal problems. J. Graph Theory 16 (1) (1992)
László Lovász, Miklós Simonovits
On the Randomized Complexity of Volume and Diameter FOCS (1992)
Ervin Györi, János Pach, Miklós Simonovits
-free graphs. Graphs Comb. 7 (1) (1991)
Miklós Simonovits, Vera T. Sós
Szemerédi's Partition and Quasirandomness. Random Struct. Algorithms 2 (1) (1991)
László Lovász, Miklós Simonovits
The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume FOCS (1990)
László Babai, Miklós Simonovits, Joel Spencer
Extremal subgraphs of random graphs. J. Graph Theory 14 (5) (1990)
Richard H. Schelp, Miklós Simonovits, Vera T. Sós
Intersection Theorems for t-Valued Functions. Eur. J. Comb. 9 (6) (1988)
W. G. Brown, Miklós Simonovits
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures. Discret. Math. 48 (2-3) (1984)
Miklós Simonovits, Vera T. Sós
. Comb. 4 (1) (1984)
Paul Erdös, Miklós Simonovits
Supersaturated graphs and hypergraphs. Comb. 3 (2) (1983)
Ralph J. Faudree, Miklós Simonovits
On a class of degenerate extremal graph problems. Comb. 3 (1) (1983)
Paul Erdös, Miklós Simonovits
Compactness results in extremal graph theory. Comb. 2 (3) (1982)
Miklós Simonovits, Vera T. Sós
Intersection Properties of Subsets of Integers. Eur. J. Comb. 2 (4) (1981)
Ronald L. Graham, Miklós Simonovits, Vera T. Sós
A Note on the Intersection Properties of Subsets of Integers. J. Comb. Theory, Ser. A 28 (1) (1980)
Dwight Duffus, Ivan Rival, Miklós Simonovits
Spanning retracts of a partially ordered set. Discret. Math. 32 (1) (1980)
Miklós Simonovits
On paul turán's influence on graph theory. J. Graph Theory 1 (2) (1977)
Miklós Simonovits
Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions. Discret. Math. 7 (3-4) (1974)
Paul Erdös, Miklós Simonovits
On a valence problem in extremal graph theory. Discret. Math. 5 (4) (1973)