| The counting lemma for regular k‐uniform hypergraphs B Nagle, V Rödl, M Schacht Random Structures & Algorithms 28 (2), 113-179, 2006 | 362 | 2006 |
| Extremal results for random discrete structures M Schacht Annals of Mathematics, 333-365, 2016 | 238 | 2016 |
| On perfect matchings in uniform hypergraphs with large minimum vertex degree H Hàn, Y Person, M Schacht SIAM Journal on Discrete Mathematics 23 (2), 732-748, 2009 | 140 | 2009 |
| Regular partitions of hypergraphs: regularity lemmas V Rödl, M Schacht Combinatorics, Probability and Computing 16 (6), 833-885, 2007 | 132 | 2007 |
| Proof of the bandwidth conjecture of Bollobás and Komlós J Böttcher, M Schacht, A Taraz Mathematische Annalen 343 (1), 175-205, 2009 | 129 | 2009 |
| Weak hypergraph regularity and linear hypergraphs Y Kohayakawa, B Nagle, V Rödl, M Schacht Journal of Combinatorial Theory, Series B 100 (2), 151-160, 2010 | 107 | 2010 |
| Dirac-type results for loose Hamilton cycles in uniform hypergraphs H Hàn, M Schacht Journal of Combinatorial Theory, Series B 100 (3), 332-346, 2010 | 96 | 2010 |
| On the KŁR conjecture in random graphs D Conlon, WT Gowers, W Samotij, M Schacht Israel Journal of Mathematics 203 (1), 535-580, 2014 | 91 | 2014 |
| The hypergraph regularity method and its applications V Rödl, B Nagle, J Skokan, M Schacht, Y Kohayakawa Proceedings of the National Academy of Sciences 102 (23), 8109-8113, 2005 | 86 | 2005 |
| Regular partitions of hypergraphs: counting lemmas V Rödl, M Schacht Combinatorics, Probability and Computing 16 (6), 887-901, 2007 | 84 | 2007 |
| Ramsey properties of random discrete structures E Friedgut, V Rödl, M Schacht Random Structures & Algorithms 37 (4), 407-436, 2010 | 79 | 2010 |
| Weak quasi‐randomness for uniform hypergraphs D Conlon, H Hàn, Y Person, M Schacht Random Structures & Algorithms 40 (1), 1-38, 2012 | 77 | 2012 |
| Generalizations of the removal lemma V Rödl, M Schacht Combinatorica 29 (4), 467-501, 2009 | 73 | 2009 |
| Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs E Buß, H Han, M Schacht Journal of Combinatorial Theory, Series B 103 (6), 658-678, 2013 | 70 | 2013 |
| Sparse partition universal graphs for graphs of bounded degree Y Kohayakawa, V Rödl, M Schacht, E Szemerédi Advances in Mathematics 226 (6), 5041-5065, 2011 | 67 | 2011 |
| Extremal hypergraph problems and the regularity method B Nagle, V Rödl, M Schacht Topics in Discrete Mathematics: Dedicated to Jarik Nešetřil on the Occasion …, 2006 | 67 | 2006 |
| The Turán theorem for random graphs Y Kohayakawa, V Rödl, M Schacht Combinatorics, Probability and Computing 13 (1), 61-91, 2004 | 59 | 2004 |
| Regularity lemmas for graphs V Rödl, M Schacht Fete of combinatorics and computer science, 287-325, 2010 | 56 | 2010 |
| Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs C Reiher, V Rödl, A Ruciński, M Schacht, E Szemerédi Proceedings of the London Mathematical Society 119 (2), 409-439, 2019 | 51 | 2019 |
| Almost all hypergraphs without Fano planes are bipartite Y Person, M Schacht Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 49 | 2009 |
Yoshiharu KohayakawaInstituto de Matemática e Estatística, Universidade de São Paulo, BrazilVerified email at ime.usp.br
