Miklós Simonovits

Ping Hu

J. Comb. Theory, Ser. B, 2015

2013

Paul Erdős' Influence on Extremal Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

On the multi-colored Ramsey numbers of cycles.

[BibT_eX]

[DOI]

Tomasz Luczak

Jozef Skokan

J. Graph Theory, 2012

2011

The fine structure of octahedron-free graphs.

[BibT_eX]

[DOI]

Béla Bollobás

J. Comb. Theory, Ser. B, 2011

2009

The typical structure of graphs without given excluded subgraphs.

[BibT_eX]

[DOI]

Béla Bollobás

Random Struct. Algorithms, 2009

A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?

[BibT_eX]

[DOI]

György Elekes

Endre Szabó

Comb. Probab. Comput., 2009

2008

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

[BibT_eX]

[DOI]

Tomasz Luczak

Discret. Math., 2008

2006

The Ramsey number for hypergraph cycles I.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2006

4-Books of three pages.

[BibT_eX]

[DOI]

Zoltán Füredi

Oleg Pikhurko

J. Comb. Theory, Ser. A, 2006

2005

Shifted products that are coprime pure powers.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2005

The 3-colored Ramsey number of odd cycles.

[BibT_eX]

[DOI]

Yoshiharu Kohayakawa

Jozef Skokan

Electron. Notes Discret. Math., 2005

A hierarchy of randomness for graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

Triple Systems Not Containing a Fano Configuration.

[BibT_eX]

[DOI]

Zoltán Füredi

Comb. Probab. Comput., 2005

2004

The number of graphs without forbidden subgraphs.

[BibT_eX]

[DOI]

Béla Bollobás

J. Comb. Theory, Ser. B, 2004

2003

How to compute the volume in high dimension?

[BibT_eX]

[DOI]

Math. Program., 2003

Different levels of randomness in Random Ramsey theorems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

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

[BibT_eX]

[DOI]

Zoltán Füredi

Oleg Pikhurko

Electron. J. Comb., 2003

2002

A note on Ramsey size-linear graphs.

[BibT_eX]

[DOI]

Paul N. Balister

Richard H. Schelp

J. Graph Theory, 2002

2001

Ramsey-Turán theory.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

The Regularity Lemma and Its Applications in Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Science, 2000

1998

Extremal graphs with bounded densities of small subgraphs.

[BibT_eX]

[DOI]

Jerrold R. Griggs

George Rubin Thomas

J. Graph Theory, 1998

Approximation of Diameters: Randomization Doesn't Help.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Random walks and an O*(n5) volume algorithm for convex bodies.

[BibT_eX]

[DOI]

Ravi Kannan

Random Struct. Algorithms, 1997

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

[BibT_eX]

[DOI]

Comb., 1997

How to solve a Turán type extremal graph problem? (Linear decomposition).

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ravi Kannan

Discret. Comput. Geom., 1995

1994

Turán-Ramsey Theorems and Kp-Independence Numbers.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

1993

Random Walks in a Convex Body and an Improved Volume Algorithm.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1993

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

[BibT_eX]

[DOI]

Comb., 1993

1992

Ramsey problems and their connection to tuŕan-type extremal problems.

[BibT_eX]

[DOI]

Ralph J. Faudree

J. Graph Theory, 1992

On the Randomized Complexity of Volume and Diameter

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Szemerédi's Partition and Quasirandomness.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1991

On the maximal number of certain subgraphs inKr-free graphs.

[BibT_eX]

[DOI]

Ervin Györi

János Pach

Graphs Comb., 1991

1990

Extremal subgraphs of random graphs.

[BibT_eX]

[DOI]

László Babai

Joel Spencer

J. Graph Theory, 1990

The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1988

Intersection Theorems for t-Valued Functions.

[BibT_eX]

[DOI]

Richard H. Schelp

Eur. J. Comb., 1988

1984

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

[BibT_eX]

[DOI]

W. G. Brown

Discret. Math., 1984

On restricted colourings of Kn.

[BibT_eX]

[DOI]

Comb., 1984

1983

On a class of degenerate extremal graph problems.

[BibT_eX]

[DOI]

Ralph J. Faudree

Comb., 1983

Supersaturated graphs and hypergraphs.

[BibT_eX]

[DOI]

Paul Erdös

Comb., 1983

1982

Compactness results in extremal graph theory.

[BibT_eX]

[DOI]

Paul Erdös

Comb., 1982

1981

Intersection Properties of Subsets of Integers.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

1980

A Note on the Intersection Properties of Subsets of Integers.

[BibT_eX]

[DOI]

Ronald L. Graham

J. Comb. Theory, Ser. A, 1980

Spanning retracts of a partially ordered set.

[BibT_eX]

[DOI]

Dwight Duffus

Ivan Rival

Discret. Math., 1980

1977

On paul turán's influence on graph theory.

[BibT_eX]

[DOI]

J. Graph Theory, 1977

1974

Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions.

[BibT_eX]

[DOI]

Discret. Math., 1974

1973

On a valence problem in extremal graph theory.

[BibT_eX]

[DOI]

Paul Erdös