2009 |
31 | EE | József Balogh,
Béla Bollobás,
Miklós Simonovits:
The typical structure of graphs without given excluded subgraphs.
Random Struct. Algorithms 34(3): 305-318 (2009) |
2008 |
30 | EE | Tomasz Luczak,
Miklós Simonovits:
On the minimum degree forcing F-free graphs to be (nearly) bipartite.
Discrete Mathematics 308(17): 3998-4002 (2008) |
2006 |
29 | EE | 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): 67-83 (2006) |
28 | EE | Zoltán Füredi,
Oleg Pikhurko,
Miklós Simonovits:
4-Books of three pages.
J. Comb. Theory, Ser. A 113(5): 882-891 (2006) |
2005 |
27 | EE | Zoltán Füredi,
Miklós Simonovits:
Triple Systems Not Containing a Fano Configuration.
Combinatorics, Probability & Computing 14(4): 467-484 (2005) |
26 | EE | Miklós Simonovits,
Vera T. Sós:
A hierarchy of randomness for graphs.
Discrete Mathematics 303(1-3): 209-233 (2005) |
25 | EE | Yoshiharu Kohayakawa,
Miklós Simonovits,
Jozef Skokan:
The 3-colored Ramsey number of odd cycles.
Electronic Notes in Discrete Mathematics 19: 397-402 (2005) |
24 | EE | Rainer Dietmann,
Christian Elsholtz,
Katalin Gyarmati,
Miklós Simonovits:
Shifted products that are coprime pure powers.
J. Comb. Theory, Ser. A 111(1): 24-36 (2005) |
2004 |
23 | EE | József Balogh,
Béla Bollobás,
Miklós Simonovits:
The number of graphs without forbidden subgraphs.
J. Comb. Theory, Ser. B 91(1): 1-24 (2004) |
2003 |
22 | | Miklós Simonovits,
Vera T. Sós:
Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs.
Combinatorics, Probability & Computing 12(3): (2003) |
21 | EE | Zoltán Füredi,
Oleg Pikhurko,
Miklós Simonovits:
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.
Electr. J. Comb. 10: (2003) |
20 | EE | Miklós Simonovits,
Vera T. Sós:
Different levels of randomness in Random Ramsey theorems.
Electronic Notes in Discrete Mathematics 15: 189-192 (2003) |
2001 |
19 | EE | Miklós Simonovits,
Vera T. Sós:
Ramsey-Turán theory.
Discrete Mathematics 229(1-3): 293-340 (2001) |
2000 |
18 | EE | 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: 84-112 |
1998 |
17 | EE | Andreas Brieden,
Peter Gritzmann,
Ravi Kannan,
Victor Klee,
László Lovász,
Miklós Simonovits:
Approximation of Diameters: Randomization Doesn't Help.
FOCS 1998: 244-251 |
1997 |
16 | | Miklós Simonovits,
Vera T. Sós:
Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs.
Combinatorica 17(4): 577-596 (1997) |
15 | | Ravi Kannan,
László Lovász,
Miklós Simonovits:
Random walks and an O*(n5) volume algorithm for convex bodies.
Random Struct. Algorithms 11(1): 1-50 (1997) |
1995 |
14 | | Ravi Kannan,
László Lovász,
Miklós Simonovits:
Isoperimetric Problems for Convex Bodies and a Localization Lemama.
Discrete & Computational Geometry 13: 541-559 (1995) |
1994 |
13 | | Paul Erdös,
András Hajnal,
Miklós Simonovits,
Vera T. Sós,
Endre Szemerédi:
Turán-Ramsey Theorems and Kp-Independence Numbers.
Combinatorics, Probability & Computing 3: 297-325 (1994) |
1993 |
12 | | 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.
Combinatorica 13(1): 31-56 (1993) |
11 | | László Lovász,
Miklós Simonovits:
Random Walks in a Convex Body and an Improved Volume Algorithm.
Random Struct. Algorithms 4(4): 359-412 (1993) |
1992 |
10 | | László Lovász,
Miklós Simonovits:
On the Randomized Complexity of Volume and Diameter
FOCS 1992: 482-491 |
1991 |
9 | | Miklós Simonovits,
Vera T. Sós:
Szemerédi's Partition and Quasirandomness.
Random Struct. Algorithms 2(1): 1-10 (1991) |
1990 |
8 | | László Lovász,
Miklós Simonovits:
The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume
FOCS 1990: 346-354 |
1984 |
7 | | Miklós Simonovits,
Vera T. Sós:
On restricted colourings of Kn.
Combinatorica 4(1): 101-110 (1984) |
6 | EE | W. G. Brown,
Miklós Simonovits:
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures.
Discrete Mathematics 48(2-3): 147-162 (1984) |
1983 |
5 | | Ralph J. Faudree,
Miklós Simonovits:
On a class of degenerate extremal graph problems.
Combinatorica 3(1): 83-93 (1983) |
4 | | Paul Erdös,
Miklós Simonovits:
Supersaturated graphs and hypergraphs.
Combinatorica 3(2): 181-192 (1983) |
1982 |
3 | | Paul Erdös,
Miklós Simonovits:
Compactness results in extremal graph theory.
Combinatorica 2(3): 275-288 (1982) |
1980 |
2 | EE | Dwight Duffus,
Ivan Rival,
Miklós Simonovits:
Spanning retracts of a partially ordered set.
Discrete Mathematics 32(1): 1-7 (1980) |
1 | | R. 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): 106-110 (1980) |