Preprints & Articles

V. Rödl, M. Schacht, Complete partite subgraphs in dense hypergraphs, Random Structures and Algorithms, to appear

D. Conlon, H. Hàn, Y. Person, M. Schacht, Weak quasi-randomness for uniform hypergraphs, Random Structures and Algorithms, 40(1), 1-38
D. Dellamonica Jr., P. Haxell, T. Łuczak, D. Mubayi, B. Nagle, Y. Person, V. Rödl, M. Schacht, J. Verstraëte, On even-degree subgraphs of linear hypergraphs, Combinatorics, Probability and Computing, 21(1-2), 113-127

M. Kang, O. Pikhurko, A. Ravsky, M. Schacht, O. Verbitsky, Untangling planar graphs from a specified vertex position – Hard cases, Discrete Applied Mathematics 159(8), 789-799
Y. Kohayakawa, V. Rödl, M. Schacht, E. Szemerédi, Sparse partition universal graphs for graphs of bounded degree, Advances in Mathematics 226(6), 5041-5065
Y. Person, M. Schacht, An expected polynomial time algorithm for coloring 2-colorable 3-graphs, Discrete Mathematics & Theoretical Computer Science, 13(2), 1-18;
Extended abstract appeared in Electron. Notes Discrete Math. 34, 465-469

N. Alon, A. Coja-Oghlan, H. Hàn, M. Kang, V. Rödl, M. Schacht, Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions, SIAM Journal on Computing 39(6), 2336-2362;
Extended abstract appeared in Proceedings of ICALP 2007, 789-800
E. Friedgut, V. Rödl, M. Schacht, Ramsey properties of random discrete structures, Random Structures and Algorithms 37(4), 407-436
H. Hàn, M. Schacht, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Journal of Combinatorial Theory (B) 100(3), 332-346
J. Hladký, M. Schacht, Note on bipartite graph tilings, SIAM Journal on Discrete Mathematics 24(2), 357-362
Y. Kohayakawa, B. Nagle, V. Rödl, M. Schacht, Weak regularity and linear hypergraphs, Journal of Combinatorial Theory (B) 100(2), 151-160
Y. Kohayakawa, V. Rödl, M. Schacht, J. Skokan, On the triangle removal lemma for subgraphs of sparse pseudorandom graphs, An Irregular Mind (Szemerédi is 70), vol. 21 series Bolyai Soc. Math. Stud., 359-404
H. Lefmann, Y. Person, M. Schacht, A structural result for hypergraphs with many restricted edge colorings, Journal of Combinatorics 1(3-4), 441-475
V. Rödl, M. Schacht, Regularity lemmas for graphs, Fete of Combinatorics and Computer Science, vol. 20 series Bolyai Soc. Math. Stud., 287-325

J. Böttcher, M. Schacht, A. Taraz, Proof of the bandwidth conjecture of Bollobás and Komlós, Math. Ann. 343(1), 175-205;
Extended abstract appeared in Electron. Notes Discrete Math. 29, 485-489
H. Hàn Y. Person, M. Schacht, On perfect matchings in uniform hypergraphs with large minimum vertex degree, SIAM Journal on Discrete Mathematics 23(2), 732-748
H. Lefmann, Y. Person, V. Rödl, M. Schacht, On colorings of hypergraphs without monochromatic Fano planes, Combinatorics, Probability and Computing 18(5), 803-818
V. Rödl, M. Schacht, Generalizations of the removal lemma, Combinatorica 29(4), 467-501;
Extended abstract appeared in Proceedings of STOC 2007, 488-495

J. Böttcher, M. Schacht, A. Taraz, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, Journal of Combinatorial Theory (B) 98(4), 752-777;
Extended abstract appeared in Proceedings of SODA 2007, 618-626
B. Nagle, S. Olsen, V. Rödl, M. Schacht, On the Ramsey number of sparse 3-graphs, Graphs and Combinatorics 24(3), 205-228
B. Nagle, V. Rödl, M. Schacht, Note on the 3-graph counting lemma, Discrete Mathematics 308(19), 4501-4517
V. Rödl, A. Ruciński, M. Schacht, E. Szemerédi, A note on perfect matchings in uniform hypergraphs with large minimum collective degree, Commentationes Mathematicae Universitatis Carolinae 49(4), 633-636

Chr. Avart, V. Rödl, M. Schacht, Every monotone 3-graph property is testable, SIAM Journal on Discrete Mathematics 21(1), 73-92;
Extended abstract appeared in: Electron. Notes Discrete Math. 22, 539-542
B. Bollobás, Y. Kohayakawa, V. Rödl, M. Schacht, A. Taraz, Essentially infinite colourings of hypergraphs, Proceedings of the London Mathematical Society 95(3), 709-734;
Extended abstract appeared in: Electron. Notes Discrete Math. 19, 179-185
Y. Kohayakawa, V. Rödl, M. Schacht, P. Sissokho, J. Skokan, Turán's theorem for pseudo-random graphs, Journal of Combinatorial Theory (A) 114(4), 631-657
V. Rödl, M. Schacht, Regular partitions of hypergraphs: Regularity Lemmas, Combinatorics, Probability and Computing 16(6), 833-885
V. Rödl, M. Schacht, Regular partitions of hypergraphs: Counting Lemmas, Combinatorics, Probability and Computing 16(6), 887-901
V. Rödl, A. Ruciński, M. Schacht, Ramsey properties of random k-partite k-uniform hypergraphs, SIAM Journal on Discrete Mathematics 21(2), 442-460
V. Rödl, M. Schacht, M. Siggers, N. Tokushige, Integer and fractional packings of hypergraphs, Journal of Combinatorial Theory (B) 97(2), 245-268

J. Bang-Jensen, B. Reed, R. Šámal, M. Schacht, B. Toft, U. Wagner, On six problems posed by Jarik Nešetřil, Topics in Discrete Mathematics, vol. 26 series Algorithms Combin., 613-627
B. Nagle, V. Rödl, M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Structures and Algorithms 28(2), 113-179
B. Nagle, V. Rödl, M. Schacht, Extremal hypergraph problems and the regularity method, Topics in Discrete Mathematics, vol. 26 series Algorithms Combin., 247-278
V. Rödl, M. Schacht, E. Tengan, N. Tokushige, Density theorems and extremal hypergraph problems, Israel Journal of Mathematics 152, 371-380

V. Rödl, B. Nagle, J. Skokan, M. Schacht, Y. Kohayakawa, The hypergraph regularity method and its applications, Proceedings of the National Academy of Sciences USA 102(23), 8109-8113

Y. Kohayakawa, V. Rödl, M. Schacht, The Turán theorem for random graphs, Combinatorics, Probability and Computing 13(1), 61-91