Home

CV

List of Publications

On even-degree subgraphs of linear hypergraphs, Combin. Probab. Comput., to appear (w/ D.Dellamonica, P.Haxell, T.Luczak, D.Mubayi, Y.Person, V.Rodl and M.Schacht)

A hypergraph regularity method for linear hypergraphs, with applications, LAP Lambert Academic Publishing (2011), 1-56 (w/ S.Khan)

On computing the frequencies of induced subhypergraphs, SIAM J. Discrete Math. 24 (2010), 322-329

On random sampling in uniform hypergraphs, Random Structures Algorithms 38 (2011), 422-440 (w/ A.Czygrinow)

Weak hypergraph regularity and linear hypergraphs, J. Combin. Theory Ser. B 100 (2010), 1510-160 (w/ Y.Kohayakawa, V.Rodl, M.Schacht)

Hypergraph regularity and quasirandomness, in: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 09), 227-235. ACM Press (w/ A.Poerschke, V.Rodl, M.Schacht)

Hereditary properties of hypergraphs, J. Combin. Theory Ser. B 99 (2009), 460-473 (w/ R.Dotson)

On the Ramsey number of sparse 3-graphs, Graphs Combin. 24 (2008), 205-228. (w/ S.Olsen, V.Rodl, M.Schacht)

An algorithmic version of the hypergraph regularity method, SIAM J. Comput. 37 (2008), 1728-1776 (w/ P.Haxell, V.Rodl)

Note on the 3-graph Counting Lemma, Discrete Math. 308 (2008), 4501-4517 (w/ V.Rodl, M.Schacht)

Extremal hypergraph problems and the regularity method, in: M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas, P. Valtr (eds): Topics in Discrete Mathematics 26, Algorithms Combin., 247-278, Springer, Berlin (w/ V.Rodl, M.Schacht)

The counting lemma for regular k-uniform hypergraphs, Random Structures Algorithms 28 (2006), 113-179 (w/ V.Rodl, M.Schacht)

The hypergraph regularity method and its applications, Proceedings of the National Academy of Science 102 (2005), 8109-8113 (w/ V.Rodl, J.Skokan, M.Schacht, Y.Kohayakawa)

An algorithmic version of the hypergraph regularity method [extended abstract], FOCS, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS' 05), 2005, 439-448 (w/ P.Haxell, V.Rodl)

Bounding the strong chromatic index of dense random graphs, Discrete Math. 281 (2004), 129-136 (w/ A.Czygrinow)

Strong edge colorings of uniform graphs, Discrete Math. 286 (2004), 219-223 (w/ A.Czygrinow)

Matrix-free proof of a regularity characterization, Electron. J. Combin. 10 (2003), Research Paper 39, 11 pp (w/ A.Czygrinow)

Hereditary properties of triple systems, Combin. Probab. Comput. 12 (2003), 248-310 (w/ Y.Kohayakawa, V.Rodl)

Regularity properties for triple systems, Random Structures Algorithms 23 (2003), 264-332 (w/ V.Rodl)

On characterizing hypergraph regularity, Random Structures Algorithms 21 (2002), 293-335 (w/ Y.Dementieva, P.Haxell, V.Rodl)

Fractional packings in dense 3-uniform hypergraphs, Random Structures Algorithms 22 (2002), 293-335 (w/ P.Haxell, V.Rodl)

Efficient testing of hypergraphs, ICALP 2002, 29th International Colloquium on Automata, Languages and Programming (Malaga, Spain), Lecture Notes in Computer Science 2286, Springer, Berlin (2002), 278-293 (w/ Y.Kohayakawa, V.Rodl)

A note on codegree problems for hypergraphs, Bull. Inst. Combin. Appl. 32 (2001), 63-69 (w/ A.Czygrinow)

The asymptotic number of triple systems not containing a fixed one, Discrete Math. 235 (2001), 271-290 (w/ V.Rodl)

Turan related problems for hypergraphs, Congr. Numer. 136 (1999), 119-127.