Miklós Simonovits

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