Miklós Simonovits

According to our database1, Miklós Simonovits authored at least 52 papers between 1973 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.
SIAM J. Discrete Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs.
SIAM J. Discrete Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs.
SIAM J. Discrete Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition.
SIAM J. Discrete Math., 2017

2015
Phase transitions in Ramsey-Turán theory.
J. Comb. Theory, Ser. B, 2015

2013
Paul Erdős' Influence on Extremal Graph Theory.
Proceedings of the Mathematics of Paul Erdős II, 2013

2012
On the multi-colored Ramsey numbers of cycles.
Journal of Graph Theory, 2012

2011
The fine structure of octahedron-free graphs.
J. Comb. Theory, Ser. B, 2011

2009
The typical structure of graphs without given excluded subgraphs.
Random Struct. Algorithms, 2009

A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?
Combinatorics, Probability & Computing, 2009

2008
On the minimum degree forcing F-free graphs to be (nearly) bipartite.
Discrete Mathematics, 2008

2006
The Ramsey number for hypergraph cycles I.
J. Comb. Theory, Ser. A, 2006

4-Books of three pages.
J. Comb. Theory, Ser. A, 2006

2005
Shifted products that are coprime pure powers.
J. Comb. Theory, Ser. A, 2005

The 3-colored Ramsey number of odd cycles.
Electronic Notes in Discrete Mathematics, 2005

A hierarchy of randomness for graphs.
Discrete Mathematics, 2005

Triple Systems Not Containing a Fano Configuration.
Combinatorics, Probability & Computing, 2005

2004
The number of graphs without forbidden subgraphs.
J. Comb. Theory, Ser. B, 2004

2003
How to compute the volume in high dimension?
Math. Program., 2003

Different levels of randomness in Random Ramsey theorems.
Electronic Notes in Discrete Mathematics, 2003

Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs.
Combinatorics, Probability & Computing, 2003

The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.
Electr. J. Comb., 2003

2002
A note on Ramsey size-linear graphs.
Journal of Graph Theory, 2002

2001
Ramsey-Turán theory.
Discrete Mathematics, 2001

2000
The Regularity Lemma and Its Applications in Graph Theory.
Proceedings of the Theoretical Aspects of Computer Science, 2000

1998
Extremal graphs with bounded densities of small subgraphs.
Journal of Graph Theory, 1998

Approximation of Diameters: Randomization Doesn't Help.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Random walks and an O*(n5) volume algorithm for convex bodies.
Random Struct. Algorithms, 1997

Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs.
Combinatorica, 1997

How to solve a Turán type extremal graph problem? (Linear decomposition).
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1995
Isoperimetric Problems for Convex Bodies and a Localization Lemama.
Discrete & Computational Geometry, 1995

1994
Turán-Ramsey Theorems and Kp-Independence Numbers.
Combinatorics, Probability & Computing, 1994

1993
Random Walks in a Convex Body and an Improved Volume Algorithm.
Random Struct. Algorithms, 1993

Turán-Ramsey theorems and simple asymptotically extremal structures.
Combinatorica, 1993

1992
Ramsey problems and their connection to tuŕan-type extremal problems.
Journal of Graph Theory, 1992

On the Randomized Complexity of Volume and Diameter
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Szemerédi's Partition and Quasirandomness.
Random Struct. Algorithms, 1991

On the maximal number of certain subgraphs inKr-free graphs.
Graphs and Combinatorics, 1991

1990
Extremal subgraphs of random graphs.
Journal of Graph Theory, 1990

The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1988
Intersection Theorems for t-Valued Functions.
Eur. J. Comb., 1988

1984
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures.
Discrete Mathematics, 1984

On restricted colourings of Kn.
Combinatorica, 1984

1983
On a class of degenerate extremal graph problems.
Combinatorica, 1983

Supersaturated graphs and hypergraphs.
Combinatorica, 1983

1982
Compactness results in extremal graph theory.
Combinatorica, 1982

1981
Intersection Properties of Subsets of Integers.
Eur. J. Comb., 1981

1980
A Note on the Intersection Properties of Subsets of Integers.
J. Comb. Theory, Ser. A, 1980

Spanning retracts of a partially ordered set.
Discrete Mathematics, 1980

1977
On paul turán's influence on graph theory.
Journal of Graph Theory, 1977

1974
Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions.
Discrete Mathematics, 1974

1973
On a valence problem in extremal graph theory.
Discrete Mathematics, 1973


  Loading...