| The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. | 0 | 0.34 | 2017 |
| The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. | 0 | 0.34 | 2017 |
| The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. | 0 | 0.34 | 2017 |
| The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. | 0 | 0.34 | 2017 |
| On the multi-colored Ramsey numbers of cycles. | 3 | 0.47 | 2012 |
| The fine structure of octahedron-free graphs | 6 | 0.57 | 2011 |
| A combinatorial distinction between unit circles and straight lines: How many coincidences can they have? | 3 | 0.50 | 2009 |
| The typical structure of graphs without given excluded subgraphs | 16 | 0.91 | 2009 |
| On the minimum degree forcing F-free graphs to be (nearly) bipartite | 0 | 0.34 | 2008 |
| 4-books of three pages | 5 | 0.53 | 2006 |
| Triple Systems Not Containing a Fano Configuration | 36 | 2.44 | 2005 |
| Shifted products that are coprime pure powers | 1 | 0.63 | 2005 |
| A hierarchy of randomness for graphs | 0 | 0.34 | 2005 |
| The 3-colored Ramsey number of odd cycles | 10 | 1.18 | 2005 |
| The number of graphs without forbidden subgraphs | 22 | 1.79 | 2004 |
| Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs | 10 | 1.38 | 2003 |
| The Turan density of the hypergraph - {abc, ade, bde, cde} | 8 | 0.95 | 2003 |
| Different levels of randomness in Random Ramsey theorems | 0 | 0.34 | 2003 |
| How to compute the volume in high dimension? | 16 | 0.96 | 2003 |
| Ramsey—Turán theory | 19 | 1.93 | 2001 |
| The regularity lemma and its applications in graph theory | 33 | 2.83 | 2000 |
| Random walks and an O*(n5) volume algorithm for convex bodies | 46 | 9.88 | 1997 |
| Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs. | 21 | 3.27 | 1997 |
| How to solve a Turán type extremal graph problem? (Linear decomposition). | 3 | 0.58 | 1997 |
| Isoperimetric Problems for Convex Bodies and a Localization Lemama | 38 | 11.43 | 1995 |
| Turán-Ramsey Theorems and Kp-Independence Numbers | 0 | 0.34 | 1994 |
| Random-Walks In A Convex Body And An Improved Volume Algorithm | 112 | 18.16 | 1993 |
| Turán-Ramsey theorems and simple asymptotically extremal structures | 4 | 0.53 | 1993 |
| Ramsey problems and their connection to Tura´n-type extremal problems | 2 | 0.57 | 1992 |
| On the maximal number of certain subgraphs inKr-free graphs | 4 | 0.72 | 1991 |
| Szemerédi's Partition and Quasirandomness | 18 | 4.14 | 1991 |
| On restricted colourings of Kn | 11 | 2.95 | 1984 |
| On a class of degenerate extremal graph problems | 22 | 7.64 | 1983 |
| Supersaturated graphs and hypergraphs | 75 | 11.74 | 1983 |
| Compactness results in extremal graph theory | 34 | 6.83 | 1982 |
