
Vojtěch Rödl
Department of Mathematics and Computer Science, Emory University
Publications
2016
 An Algorithmic Hypergraph Regularity Lemma
(with B. Nagle and M. Schacht)
Proc. of 27th ACMSIAM Symp. on Discrete Algorithm, 2016, vol. 1, pg. 1765  1773
 On the number of B_hsets
(with D. Dellamonica, Y. Kohayakawa, S. Lee and W. Samotij)
Combin. Probab. Comput., 2016, vol. 25(1), pg. 108  129
 Hypergraph Ramsey numbers: tight cycles versus cliques
(with D. Mubayi)
Bull. London Math. Soc., 2016, vol. 48(1), pg. 127  134
 A note on supersaturated set systems
(with P. Frankl and Y. Kohayakawa)
European J. Combin., 2016, vol. 51, pg. 190  199
 A Short Proof of the Induced Ramsey Theorem for Hypergraphs
(with V. Bhat)
Discrete Math., 2016, vol. 339(3), pg. 1147  1149
 An Induced Ramsey Theorem for kpartite, kuniform Hypergraphs
(with D. Dellamonica and S. La Fleur)
Random Structures \& Algorithms, 2016, vol. 48(1), pg. 5  20
2015
 Ramseytype numbers of hypergraphs
(with H. Han, T. Retter and M. Schacht)
LatinAmerican Algorithms, Graphs and Optimization Symposium, LAGOS (2015, Fortaleza), Electronic Notes Discrete Mathematics, Fortaleza, Brazil, 2015, pg. 457  463
 Quasirandomness and the regularity method in hypergraphs
Volume I (Plenary Lectures) International Congress of Mathematicians, ICM (2015), 2015, pg. 571  599
 The Number of Sidon Sets and the Maximum Size of Sidon Sets Contained in a Sparse Random Set of Integers
(with Y. Kohayakawa, S. Lee and W. Samotij)
Random Structures \& Algorithms, 2015, vol. 46, no. 1, pg. 1  25
 An optimal algorithm for computing FriezeKannan regular partitions
(with D. Dellamonica, S. Kalyanasundaram, D. Martin and A. Shapira)
Combin. Probab. Comput., 2015, vol. 24, no. 2, pg. 407  437
 An improved upper bound on the density of universal random graphs
(with D. Dellamonica, Y. Kohayakawa and A. Ruciński)
Random Structures \& Algorithms, 2015, vol. 46, no. 2, pg. 274  299
2014
 Packing grids into complete graphs
(with S. Messuti and M. Schacht)
Proceedings of the 9th International Colloquium on Graph Theory and Combinatorics, ICGT (2014), 2014, pp. 4
 On generalized shift graphs
(with C. Avart and T. Łuczak)
Fundamenta Mathematicae, 2014, vol. 226, no. 2, pg. 173  199
 On generalized Ramsey numbers of Erdos and Rogers
(with A. Dudek and T. Retter)
J. Combin. Theory Ser. B, 2014, vol. 109, pg. 213  237
 Families of triples with high minimum degree are Hamiltonian
(with A. Ruciński)
Disscuss. Math., 2014, vol. 34, pg. 363  383
 Degree Ramsey Numbers of Closed Blowups of Trees
(with P. Horn and K. Milans)
Electron. J. Combin., 2014, vol. 21, no. 2, pp. 6
 Specified Intersections
(with D. Mubayi)
Trans. Amer. Math. Soc., 2014, vol. 366, no. 1, pg. 491  504
2013
 Extremal results in random graphs
(with M. Schacht)
Erdos Centennial, 2013, pg. 535  584
 The complexity of proving that a graph is Ramsey
(with M. Lauria, P. Pudlák and N. Thapen)
International Colloquium on Automata, Languages and Programming, ICALP (2013), Lecture Notes in Computer Science Volume 7965, 2013, pg. 684  695
 Jumps and Nonjumps in Multigraphs
(with P. Horn and S. La Fleur)
SIAM J. Discrete Math., 2013, vol. 27, no. 2, pg. 1040  1054
 Note on Upper Density of Quasirandom Hypergraphs
(with V. Bhat)
Electron. J. Combin., 2013, vol. 20, no. 2, pg. 1  8
 Some recent results on Ramseytype numbers
(with A. Dudek and P. Frankl)
Discrete Appl. Math., 2013, vol. 161, no. 9, pg. 1197  1202
 Note on the point character of l1spaces
(with C. Avart and P. Komjáth)
Periodica Mathematica Hungarica, 2013, vol. 66, no. 2, pg. 181  192
 Maximal independent sets in the covering graph of the cube
(with D. Duffus and P. Frankl)
Discrete Appl. Math., 2013, vol. 161, no. 9, pg. 1203  1208
2012
 An improved upper bound on the density of universal random graphs (extended abstract)
(with D. Dellamonica, Y. Kohayakawa and A. Ruciński)
Latin American Theoretical Computer Science Symposium, LATIN (2012), LNCS 7256, 2012, pg. 231  242
 Large matchings in uniform hypergraphs and the conjecture of Erdös and Samuels
(with N. Alon, P. Frankl, H. Huang, A. Ruciński and B. Sudakov)
J. Combin. Theory Ser. A, 2012, vol. 119, pg. 1200  1215
 Complete partite subgraphs in relatively dense hypergraphs
(with M. Schacht)
Random Structures \& Algorithms, 2012, vol. 41, no. 4, pg. 557  573
 On the maximum number of edges in a triple system not containing a disjoint family of a given size
(with P. Frankl and A. Ruciński)
Combin. Probab. Comput., 2012, vol. 21, pg. 141  148
 A Deterministic Algorithm for the FriezeKannan Regularity Lemma
(with D. Dellamonica, S. Kalyanasundaram, D. Martin and A. Shapira)
SIAM J. Discrete Math., 2012, vol. 26(1), pg. 15  29
 Universality of Random Graphs
(with D. Dellamonica, Y. Kohayakawa and A. Ruciński)
SIAM J. Discrete Math., 2012, vol. 26(1), pg. 353  374
 On trees and near vertexregularity
(with D. Dellamonica, P. Haxell, T. Łuczak, D. Mubayi, B. Nagle, Y. Person and M. Schacht)
Journal of Combinatorics, 2012, vol. 3, no. 1, pg. 49  62
 On evendegree subgraphs of linear hypergraphs
(with D. Dellamonica, P. Haxell, T. Łuczak, D. Mubayi, B. Nagle, Y. Person, M. Schacht and J. Verstraëte)
Combin. Probab. Comput., 2012, vol. 21, no. 1  2, pg. 113  127
 Distance preserving Ramsey graphs
(with D. Dellamonica)
Combin. Probab. Comput., 2012, vol. 21, no. 4, pg. 554  581
 On induced Folkman numbers
(with A. Dudek and R. Ramadurai)
Random Structures \& Algorithms, 2012, vol. 40, no. 4, pg. 493  500
2011
 A Deterministic Algorithm for the FriezeKannan Regularity Lemma
(with D. Dellamonica, D. Martin and A. Shapira)
APPROX'11/RANDOM'11 (2011), Proceedings of the 14th and 15th international conference on Approximation, randomization, 2011, pg. 495  506
 The maximum size of a Sidon set contained in a sparse random set of integers
(with Y. Kohayakawa and S. Lee)
SODA, ACMSIAM Symposium on Discrete Algorithms (2011, San Francisco, CA), 2011, pg. 159  171
 A note on Thomassen's conjecture
(with D. Dellamonica)
J. Combin. Theory Ser. B, 2011, vol. 101, no. 6, pg. 509  515
 On a conjecture of Thomassen
(with D. Dellamonica, V. Koubek and D. Martin)
J. Graph Theory, 2011, vol. 67, no. 4, pg. 316  331
 On the function of Erdos and Rogers
(with A. Dudek)
Ramsey Theory, Progr. Math.  vol. 285, 2011, pg. 63  76
 On K_{s}free subgraphs in K_{s+k}free graphs and vertex Folkman numbers
(with A. Dudek)
Combinatorica, 2011, vol. 31, pg. 39  53
 Maximal independent sets in bipartite graphs obtained from boolean lattices
(with D. Duffus and P. Frankl)
European J. Combin., 2011, vol. 32, no. 1, pg. 1  9
 Hereditary quasirandom properties of hypergraphs
(with D. Dellamonica)
Combinatorica, 2011, vol. 31, no. 2, pg. 165  182
 Diractype condition for hamiltonian paths and cycles in 3uniform hypergraphs
(with A. Ruciński and E. Szemerédi)
Advances in Mathematics, 2011, vol. 227, pg. 1225  1299
 Sparse partition universal graphs for graphs of bounded degree
(with Y. Kohayakawa, M. Schacht and E. Szemerédi)
Advances in Mathematics, 2011, vol. 226, no. 6, pg. 5041  5065
2010
 A theorem on incidence matrices and quasirandom hypergraphs
(with D. Dellamonica and P. Frankl)
Proceedings of the IPM 20, Combinatorics (2009, Tehran), Contemporary Mathematics, ed. R. Brualdi, 2010, pg. 201  207
 Metric spaces with point character equal to their size
(with C. Avart and P. Komjáth)
Comment. Math. Univ. Carolin., 2010, vol. 51, no. 3, pg. 459  467
 On the triangle removal lemma for subgraphs of sparse pseudorandom graphs
(with Y. Kohayakawa, M. Schacht and J. Skokan)
An Irregular Mind  Szemerédi is 70 (eds. I. Bárány, J. Solymosi), 2010, pg. 359  404
 Coloring uniform hypergraphs with small edge degrees
(with A. V. Kostochka and M. Kumbhat)
Fete of Combinatorics and Computer Science Vol. 2 (eds. G. Katona, A. Schrijver, T. Szonyi), 2010, pg. 213  238
 An almost quadratic bound on vertex Folkman Numbers
(with A. Dudek)
J. Combin. Theory Ser. B, 2010, vol. 100, no. 2, pg. 132  140
 On the number of graphs with a given endomorphism monoid
(with V. Koubek)
Discrete Math., 2010, vol. 310, no. 3, pg. 376  384
 Some constructive bounds on Ramsey numbers
(with A. V. Kostochka and P. Pudlák)
J. Combin. Theory Ser. B, 2010, vol. 100, no. 5, pg. 439  445
 Ramsey properties of random discrete structures
(with E. Friedgut and M. Schacht)
Random Structures \& Algorithms, 2010, vol. 37, no. 4, pg. 407  436
 Weak regularity and linear hypergraphs
(with Y. Kohayakawa, B. Nagle and M. Schacht)
J. Combin. Theory Ser. B, 2010, vol. 100, no. 2, pg. 151  160
 Note on robust critical graphs with large odd girth
(with E. Nastase and M. H. Siggers)
Discrete Math., 2010, vol. 310, no. 3, pg. 499  504
 Diractype Questions for Hypergraphs  a Survey (or More Problems for Endré to Solve)
(with A. Ruciński)
An Irregular Mind  Szemerédi is 70 (eds. I. Bárány, J. Solymosi), 2010, pg. 561  590
 Regularity Lemmas for Graphs
(with M. Schacht)
Fete of Combinatorics and Computer Science Vol. 2 (eds. G. Katona, A. Schrijver, T. Szonyi), 2010, pg. 287  326
 Construction of sparse uniform hypergraphs with high chromatic number
(with A. V. Kostochka)
Random Structures \& Algorithms, 2010, vol. 36, no. 1, pg. 46  56
 Quasirandomness and algorithmic regularity for graphs with general degree distributions
(with N. Alon, A. CojaOghlan, H. Han, K. Mihyun and M. Schacht)
SIAM J. Comput., 2010, vol. 39, no. 6, pg. 2336  2362
2009
 On graphs with a given endomorphism monoid
(with V. Koubek and B. Shemmer)
J. Graph Theory, 2009, vol. 62, no. 3, pg. 241  262
 Colorfull Flowers
(with C. Avart, P. Komjáth and T. Łuczak)
Topology Appl., 2009, vol. 156, no. 7, pg. 1386  1395
 Some recollections on early work with Jan Pelant
(with V. Müller and J. Nešetřil)
Topology Appl., 2009, vol. 156, no. 7, pg. 1438  1443
 Cliques in Steiner Systems
(with A. Dudek and F. Franěk)
Math. Slovaca, 2009, vol. 59, pg. 109  120
 The Ramsey number for hypergraph cycles II
(with P. Haxell, Y. Peng, A. Ruciński, J. Skokan and T. Łuczak)
Combin. Probab. Comput., 2009, vol. 18, pg. 165  204
 Improving connectivity and robustness in unstructured P2P networks by randomness
(with Y. Kohayakawa, V. Sunderam and J. Zich)
Internet Mathematics, 2009, vol. 5, no. 3, pg. 195  218
 Generalizations of the removal lemma
(with M. Schacht)
Combinatorica, 2009, vol. 29, no. 4, pg. 467  502
 Representing subdirect product monoids by graphs
(with V. Koubek and B. Shemmer)
International J. of Algebra and Computations, 2009, vol. 19, no. 5, pg. 705  721
 Note on asymptotically good packings
(with D. Martin)
J. Combin. Designs, 2009, vol. 17, no. 6, pg. 448  455
 On kchromatically connected graphs
(with A. Dudek and E. Nastase)
Discrete Math., 2009, vol. 309, no. 18, pg. 5547  5550
 On colorings of hypergraphs without monochromatic Fano planes
(with H. Lefmann, Y. Person and M. Schacht)
Combin. Probab. Comput., 2009, vol. 18, pg. 803  818
 Hypergraph regularity and quasirandomness
(with B. Nagle, A. Poerschke and M. Schacht)
ACMSIAM Symposium on Discrete Algorithms, SODA (2009), 2009, pg. 227  236
 Perfect matchings in large uniform hypergraphs with large minimum collective degree
(with A. Ruciński and E. Szemerédi)
J. Combin. Theory Ser. A, 2009, vol. 116, pg. 613  636
 A note on the universal and canonically colored sequences
(with A. Dudek and P. Frankl)
Combin. Probab. Comput., 2009, vol. 18, pg. 683  689
2008
 A note on perfect matchings in uniform hypergraphs with large minimum collective degree
(with A. Ruciński, M. Schacht and E. Szemerédi)
Comment. Math. Univ. Carolinae, 2008, vol. 49(4), pg. 633  636
 Finding Folkman Numbers via MAX CUT Problem
(with A. Dudek)
Electron. Notes Discrete Math., 2008, vol. 30, pg. 99  104
 New Upper Bound on Vertex Folkman Numbers
(with A. Dudek)
Lecture Notes in Computer Science, 2008, vol. 4957, pg. 473  478
 An algorithmic version of the hypergraph regularity method
(with P. Haxell and B. Nagle)
SIAM J. Comput., 2008, vol. 37, no. 6, pg. 1728  1776
 On the Folkman Number f(2, 3, 4)
(with A. Dudek)
Experiment. Math., 2008, vol. 17(1), pg. 63  67
 Note on the 3graph counting lemma
(with B. Nagle and M. Schacht)
Discrete Math., 2008, vol. 308, no. 19, pg. 4501  4517
 On Ramsey minimal graphs
(with M. H. Siggers)
SIAM J. Discrete Math., 2008, vol. 22, pg. 467  488
 On the Turán Properties of Infinite Graphs
(with A. Dudek)
Electron. J. Combin., 2008, vol. 15, no. 1, pg. 1  14
 On the Ramsey number of sparse 3graphs
(with B. Nagle, S. Olsen and M. Schacht)
Graphs Combin., 2008, vol. 24, no. 3, pg. 205  228
 Triangulations and the Hajos conjecture
(with J. Zich)
J. Graph Theory, 2008, vol. 59, no. 4, pg. 293  325
 An approximate Diractype theorem for kuniform hypergraphs
(with A. Ruciński and E. Szemerédi)
Combinatorica, 2008, vol. 28, no. 2, pg. 229  260
 Universality of Random Graphs
(with D. Dellamonica, Y. Kohayakawa and A. Ruciński)
Symposium on Discrete Algorithms, SODA (2008, San Francisco, CA), Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Mathematics, SIAM, San Francisco, CA, 2008, pg. 782  788
2007
 Property testing in hypergraphs and the removal lemma
(with M. Schacht)
39th ACM Symposium on Theory of Computing, STOC (2007, San Diego, CA), Proceedings of STOC 2007, 2007, pp. 488
 On the chromatic number and independence number of hypergraph products
(with D. Mubayi)
J. Combin. Theory Ser. B, 2007, vol. 97, no. 1, pg. 151  155
 A note on the jumping constant conjecture of Erdős
(with P. Frankl, Y. Peng and J. Talbot)
J. Combin. Theory Ser. B, 2007, vol. 97, no. 2, pg. 204  216
 Essentially infinite colourings of hypergraphs
(with B. Bollobás, Y. Kohayakawa, M. Schacht and A. Taraz)
Proc. London Math. Soc., 2007, vol. 95(3), pg. 709  734
 Ramsey properties of random kpartite kuniform hypergraphs
(with A. Ruciński and M. Schacht)
SIAM J. Discrete Math., 2007, vol. 21, no. 2, pg. 442  460
 Integer and fractional packings of hypergraphs
(with M. Schacht, M. H. Siggers and N. Tokushige)
J. Combin. Theory Ser. B, 2007, vol. 97, no. 2, pg. 245  268
 Small subsets inherit sparse epsilonregularity
(with S. Gerke, Y. Kohayakawa and A. Steger)
J. Combin. Theory Ser. B, 2007, vol. 97, no. 1, pg. 34  56
 Quasirandomness and algorithmic regularity for graphs with general degree distributions
(with N. Alon, A. CojaOghlan, H. Han, K. Mihyun and M. Schacht)
34th International Colloquium on Automata, Languages and Programming, ICALP (2007, Wrocław), Proceedings of ICALP 2007, 2007, pg. 789  800
 Turán's theorem for pseudorandom graphs
(with Y. Kohayakawa, M. Schacht, P. A. Sissokho and J. Skokan)
J. Combin. Theory Ser. A, 2007, vol. 114, no. 4, pg. 631  657
 Every monotone 3graph property is testable
(with C. Avart and M. Schacht)
SIAM J. Discrete Math., 2007, vol. 21, pg. 73  92
 Regular partitions of hypergraphs: Regularity Lemmas
(with M. Schacht)
Combin. Probab. Comput., 2007, vol. 16, no. 6, pg. 833  885
 Regular partititions of hypergraphs: Counting Lemmas
(with M. Schacht)
Combin. Probab. Comput., 2007, vol. 16, no. 6, pg. 887  901
 Measures of Pseudorandomness for Finite Sequences: Typical Values
(with N. Alon, Y. Kohayakawa, C. Mauduit and C. G. Moreira)
Proc. London Math. Soc., 2007, vol. 95, no. 3, pg. 778  812
2006
 A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
(with E. Friedgut, A. Ruciński and P. Tetali)
Mem. Amer. Math. Soc., 2006, vol. 179, no. 845, pg. 1  66
 The Counting Lemma for regular kuniform hypergraphs
(with B. Nagle and M. Schacht)
Random Structures \& Algorithms, 2006, vol. 28, no. 22, pg. 113  179
 The Ramsey number for hypergraph cycles I
(with P. Haxell, M. Simonovits, T. Łuczak, Y. Peng, A. Ruciński and J. Skokan)
J. Combin. Theory Ser. A, 2006, vol. 113, no. 1, pg. 67  83
 Applications of the regularity lemma for uniform hypergraphs
(with J. Skokan)
Random Structures \& Algorithms, 2006, vol. 28, no. 2, pg. 180  194
 A Diractype theorem for 3uniform hypergraphs
(with A. Ruciński and E. Szemerédi)
Combin. Probab. Comput., 2006, vol. 15, no. 1  2, pg. 229  251
 Measures of Pseudorandomness for Finite Sequences: Minimal Values
(with N. Alon, Y. Kohayakawa, C. Mauduit and C. G. Moreira)
Combin. Probab. Comput., 2006, vol. 15, no. 1  2, pg. 1  29
 Extremal hypergraph problems and the regularity method
(with B. Nagle and M. Schacht)
Topics in Discrete Mathematics, 2006, pg. 247  278
 Short paths in quasirandom triple systems with sparse underlying graphs
(with J. Polcyn, A. Ruciński and E. Szemerédi)
J. Combin. Theory Ser. B, 2006, vol. 96, no. 4, pg. 584  607
 Color critical hypergraphs with many edges
(with M. H. Siggers)
J. Graph Theory, 2006, vol. 53, no. 1, pg. 56  74
 A note on a conjecture by Füredi
(with E. Tengan)
J. Combin. Theory Ser. A, 2006, vol. 133, no. 6, pg. 1214  1218
 On Ramsey numbers of uniform hypergraphs with given maximum degree
(with A. V. Kostochka)
J. Combin. Theory Ser. A, 2006, vol. 113, no. 7, pg. 1555  1564
 Perfect matching in uniform hypergraphs with large minimum degree
(with A. Ruciński and E. Szemerédi)
European J. Combin., 2006, vol. 27, no. 8, pg. 1333  1349
 Density theorems and extremal hypergraph problems
(with M. Schacht, E. Tengan and N. Tokushige)
Israel J. Math., 2006, vol. 152, pg. 371  380
 Supersaturation for RamseyTurán problems
(with D. Mubayi)
Combinatorica, 2006, vol. 26, no. 3, pg. 315  332
 Chromatic numbers and homomorphisms of large girth hypergraphs
(with D. Duffus, B. Sands and N. Sauer)
Topics in Discrete Mathematics, 2006, pg. 455  471
2005
 The hypergraph regularity method and its applications
(with Y. Kohayakawa, B. Nagle, M. Schacht and J. Skokan)
Proc. Natl. Acad. Sci., 2005, vol. 102, no. 23, pg. 8109  8113
 An algorithmic version of the hypergraph regularity (extended abstract)
(with P. Haxell and B. Nagle)
The 46th Annual Symposium on Foundations of Computer Science, FOCS (2005, Pittsburgh, PA), 2005, pg. 439  448
 The Generalization of Dirac's Theorem for Hypergraphs
(with A. Ruciński and E. Szemerédi)
30th International Symposium on Mathematical Foundations of Computer Science, MFCS (2005, Gdańsk), 2005, pg. 52  56
 Distance graphs on the integers
(with M. Ferrara and Y. Kohayakawa)
Combin. Probab. Comput., 2005, vol. 14, no. 1  2, pg. 107  131
 Sharp bounds for some multicolor Ramsey numbers
(with N. Alon)
Combinatorica, 2005, vol. 25, no. 2, pg. 125  141
 Counting small cliques in 3uniform hypergraphs
(with Y. Peng and J. Skokan)
Combin. Probab. Comput., 2005, vol. 14, no. 3, pg. 371  413
 On Cover Graphs and Dependent Arcs in Acyclic Orientations
(with L. Thoma)
Combin. Probab. Comput., 2005, vol. 14, no. 14, pg. 585  617
 Counting subgraphs in quasirandom 4uniform hypergraphs
(with J. Skokan)
Random Structures \& Algorithms, 2005, vol. 26, no. 1  2, pg. 160  203
2004
 On graphs with small Ramsey numbers II
(with A. V. Kostochka)
Combinatorica, 2004, vol. 24, pg. 389  401
 Strong Ramsey properties of simplices
(with P. Frankl)
Israel J. Math., 2004, vol. 139, pg. 215  236
 Uniform edge distribution in hypergraphs is hereditary
(with D. Mubayi)
Electron. J. Combin., 2004, vol. 11, pp. 32
 Embedding graphs with bounded maximum degree in sparse graphs
(with Y. Kohayakawa and P. A. Sissokho)
Israel J. Math., 2004, vol. 139, pg. 93  137
 Pseudorandom sets and explicit constructions of Ramsey graphs
(with P. Pudlák)
Quaderni Di Matematica, 13: Complexity of computations and proofs, 2004, pg. 327  346
 Regularity lemma for uniform hypergraphs
(with J. Skokan)
Random Structures \& Algorithms, 2004, vol. 25, no. 1, pg. 1  42
 The Turán Theorem for Random Graphs
(with Y. Kohayakawa and M. Schacht)
Combin. Probab. Comput., 2004, vol. 13, no. 1, pg. 61  91
2003
 Measures of Pseudorandomness for Finite Sequences: minimum a typical values
(with Y. Kohayakawa, C. Mauduit and C. G. Moreira)
4th International Conference on Combinatorics of Words, WORDS (2003, Turku), 2003, pg. 159  169
 On large intersecting subfamilies of uniform setfamilies
(with R. Duke and P. Erdős)
Random Structures \& Algorithms, 2003, vol. 23, no. 4, pg. 351  356
 Ramsey games against a onearmed bandit
(with E. Friedgut, Y. Kohayakawa, A. Ruciński and P. Tetali)
Combin. Probab. Comput., 2003, vol. 12, no. 5  6, pg. 515  546
 Independent Deuber sets in graphs on the natural numbers
(with D. S. Gunderson, I. Leader and H. J. Prömel)
J. Combin. Theory Ser. A, 2003, vol. 103, no. 2, pg. 305  322
 Regular pairs in sparse random graphs
(with Y. Kohayakawa)
Random Structures \& Algorithms, 2003, vol. 22, no. 4, pg. 359  434
 On homogenous sets of positive integers
J. Combin. Theory Ser. A, 2003, vol. 102, no. 1, pg. 229  240
 Hereditary properties of triple systems
(with Y. Kohayakawa and B. Nagle)
Combin. Probab. Comput., 2003, vol. 12, no. 2, pg. 155  189
 Szemerédi's regularity lemma and quasirandomness
(with Y. Kohayakawa)
CMS Books in Mathematics: Recent advances in algorithms and combinatorics, 2003, pg. 289  351
 Integer and fractional packings in dense 3uniform hypergraphs
(with P. Haxell and B. Nagle)
Random Structures \& Algorithms, 2003, vol. 22, no. 3, pg. 248  310
 Regularity properties for triple systems
(with B. Nagle)
Random Structures \& Algorithms, 2003, vol. 23, no. 3, pg. 264  332
 An Optimal Algorithm for Checking Regularity
(with Y. Kohayakawa and L. Thoma)
SIAM J. Comput., 2003, vol. 32, no. 5, pg. 1210  1235
2002
 Efficient testing of hypergraphs (extended abstract)
(with Y. Kohayakawa and B. Nagle)
29th International Colloquium on Automata, Languages, and Programming, ICALP (2002, Málaga), Lecture Notes in Computer Science 2380, Springer, 2002, pg. 1017  1028
 An optimal algorithm for checking regularity (extended abstract)
(with Y. Kohayakawa and L. Thoma)
Thirteenth ACMSIAM Symposium on Discrete Algorithms, SODA (2002, San Francisco, CA), 2002, pg. 277  286
 On characterizing hypergraph regularity
(with Y. Dementieva, P. Haxell and B. Nagle)
Random Structures \& Algorithms, 2002, vol. 21, no. 2  3, pg. 293  335
 Ramsey properties of families of graphs
(with R. L. Graham, T. Łuczak and A. Ruciński)
J. Combin. Theory Ser. B, 2002, vol. 86, no. 2, pg. 413  419
 On the Turán number of triple systems
(with D. Mubayi)
J. Combin. Theory Ser. A, 2002, vol. 100, no. 1, pg. 136  152
 Extremal problems on set systems
(with P. Frankl)
Random Structures \& Algorithms, 2002, vol. 20, no. 2, pg. 131  164
 Hypergraphs, quasirandomness, and conditions for regularity
(with Y. Kohayakawa and J. Skokan)
J. Combin. Theory Ser. A, 2002, vol. 97, no. 2, pg. 307  352
 Holes in graphs
(with Y. Peng and A. Ruciński)
Electron. J. Combin., 2002, vol. 9, pg. 1  18
2001
 Proof of a hypercontractive estimate via entropy
(with E. Friedgut)
Israel J. Math., 2001, vol. 125, pg. 369  380
 On bipartite graphs with linear Ramsey numbers
(with R. L. Graham and A. Ruciński)
Combinatorica, 2001, vol. 21, no. 2, pg. 199  209
 Integer and fractional packings in dense graphs
(with P. Haxell)
Combinatorica, 2001, vol. 21, no. 1, pg. 13  38
 Nearoptimum universal graphs for graphs with bounded degrees (extended abstract)
(with N. Alon, M. R. Capalbo, Y. Kohayakawa, A. Ruciński and E. Szemerédi)
5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM (2001, Berkeley, CA), Lecture Notes in Computer Science 2129, Springer, Berlin, 2001, pg. 170  180
 On graphs with small Ramsey numbers
(with A. V. Kostochka)
J. Graph Theory, 2001, vol. 37, no. 4, pg. 198  204
 Matchings meeting quotas and their impact on the blowup lemma
(with A. Ruciński and M. Wagner)
SIAM J. Comput., 2001, vol. 31, no. 2, pg. 428  446
 On the chromatic number of set systems
(with A. V. Kostochka, D. Mubayi and P. Tetali)
Random Structures \& Algorithms, 2001, vol. 19, no. 2, pg. 87  98
 The asymptotic number of triple systems not containing a fixed one
(with B. Nagle)
Discrete Math., 2001, vol. 235, no. 1  3, pg. 271  290
 Independent arithmetic progressions in cliquefree graphs on the natural numbers
(with D. S. Gunderson, I. Leader and H. J. Prömel)
J. Combin. Theory Ser. A, 2001, vol. 93, no. 1, pg. 1  17
2000
 Universality and tolerance (extended abstract)
(with N. Alon, M. R. Capalbo, Y. Kohayakawa, A. Ruciński and E. Szemerédi)
The 41st Annual Symposium on Foundations of Computer Science, FOCS (2000, Redondo Beach, CA), 2000, pg. 14  21
 On size Ramsey numbers of graphs with bounded degree
(with E. Szemerédi)
Combinatorica, 2000, vol. 20, no. 2, pg. 257  262
 Equivalent conditions of regularity (extended abstract)
(with Y. Kohayakawa and J. Skokan)
Latin American Theoretical Informatics, LATIN (2000, Punta del Este), Lecture Notes in Computer Science vol. 1776, Springer, Berlin, 2000, pg. 48  57
 Algorithmic aspects of regularity (invited paper)
(with Y. Kohayakawa)
Latin American Theoretical Informatics, LATIN (2000, Punta del Este), Lecture Notes in Computer Science vol. 1776, Springer, Berlin, 2000, pg. 1  17
 An algorithmic regularity lemma for hypergraphs
(with A. Czygrinow)
SIAM J. Comput., 2000, vol. 30, no. 4, pg. 1041  1066
 On graphs with linear Ramsey numbers
(with R. L. Graham and A. Ruciński)
J. Graph Theory, 2000, vol. 35, no. 3, pg. 176  192
1999
 Hypergraph packing and graph embedding
(with A. Ruciński and A. Taraz)
Combin. Probab. Comput., 1999, vol. 8, no. 4, pg. 363  376
 On systems of small sets with no large Δsubsystems
(with A. V. Kostochka and L. A. Talysheva)
Combin. Probab. Comput., 1999, vol. 8, no. 3, pg. 265  268
 Perfect matchings in εregular graphs and the blowup lemma
(with A. Ruciński)
Combinatorica, 1999, vol. 19, no. 3, pg. 437  452
 NonRamsey graphs are c log(n)universal
(with H. J. Prömel)
J. Combin. Theory Ser. A, 1999, vol. 88, no. 2, pg. 379  384
 Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
(with D. S. Gunderson and A. Sidorenko)
J. Combin. Theory Ser. A, 1999, vol. 88, no. 2, pg. 342  367
 Constructive quasiRamsey numbers and tournament ranking
(with A. Czygrinow and S. Poljak)
SIAM J. Discrete Math., 1999, vol. 12, no. 1, pg. 48  63
1998
 Partitioning twocoloured complete graphs into two monochromatic cycles
(with T. Łuczak and E. Szemerédi)
Combin. Probab. Comput., 1998, vol. 7, no. 4, pg. 423  436
 Partial Steiner systems and matchings in hypergraphs
(with A. V. Kostochka)
Random Structures \& Algorithms, 1998, vol. 13, no. 3  4, pg. 335  347
 Induced Ramsey numbers
(with Y. Kohayakawa and H. J. Prömel)
Combinatorica, 1998, vol. 18, no. 3, pg. 373  404
 On large systems of sets with no large weak Δsubsystems
(with A. V. Kostochka)
Combinatorica, 1998, vol. 18, no. 2, pg. 235  240
 Independent finite sums in graphs defined on the natural numbers
(with T. Łuczak and T. Schoen)
Discrete Math., 1998, vol. 181, no. 1  3, pg. 289  294
 Biased positional games on hypergraphs
(with D. Duffus and T. Łuczak)
Studia Sci. Math. Hungar., 1998, vol. 34, no. 1  3, pg. 141  149
 Perfect matchings in εregular graphs
(with N. Alon and A. Ruciński)
Electron. J. Combin., 1998, vol. 5, no. 1, pg. 4  7
 Extremal problems for affine cubes of integers
(with D. S. Gunderson)
Combin. Probab. Comput., 1998, vol. 7, no. 1, pg. 65  79
 Endomorphisms of partially ordered sets
(with D. Duffus, T. Łuczak and A. Ruciński)
Combin. Probab. Comput., 1998, vol. 7, no. 1, pg. 33  46
 Ramsey properties of random hypergraphs
(with A. Ruciński)
J. Combin. Theory Ser. A, 1998, vol. 81, no. 1, pg. 1  33
 An algorithmic embedding of graphs via perfect matchings
(with A. Ruciński and M. Wagner)
2nd International Symposium on Randomization and Approximation Techniques in Computer Science, RANDOM (1998, Barcelona), Springer, Berlin, 1998, pg. 25  34
1997
 Arrangeability and clique subdivisions
(with R. Thomas)
The mathematics of Paul Erdős II, Algorithms Combin. 14, 1997, pg. 236  239
 Boolean circuits, tensor ranks, and communication complexity
(with P. Pudlák and J. Sgall)
SIAM J. Comput., 1997, vol. 26, no. 3, pg. 605  633
 Bipartite coverings of graphs
(with A. Ruciński)
Combin. Probab. Comput., 1997, vol. 6, no. 3, pg. 349  352
 Rado partition theorem for random subsets of integers
(with A. Ruciński)
Proc. London Math. Soc., 1997, vol. 74, no. 3, pg. 481  502
 Note on regular subgraphs
(with B. Wysocka)
J. Graph Theory, 1997, vol. 24, no. 2, pg. 139  154
 On K4free subgraphs of random graphs
(with Y. Kohayakawa and T. Łuczak)
Combinatorica, 1997, vol. 17, no. 2, pg. 173  213
 Chromatic Ramsey theory
(with N. Sauer and R. Woodrow)
European J. Combin., 1997, vol. 18, no. 1, pg. 93  102
 On the size of set systems on [n] not containing weak (r,Δ)systems
(with L. Thoma)
J. Combin. Theory Ser. A, 1997, vol. 80, no. 1, pg. 166  173
1996
 Arithmetic progressions of length three in subsets of a random set
(with Y. Kohayakawa and T. Łuczak)
Acta Arith., 1996, vol. 75, no. 2, pg. 133  163
 Graphs of small dimensions
(with N. Eaton)
Combinatorica, 1996, vol. 16, no. 1, pg. 59  85
 On pintersection representations
(with N. Eaton and R. J. Gould)
J. Graph Theory, 1996, vol. 21, no. 4, pg. 377  392
 Asymptotic packing and the random greedy algorithm
(with L. Thoma)
Random Structures \& Algorithms, 1996, vol. 8, no. 3, pg. 161  177
 Extremal problems for linear orders on [n]^p
(with R. Švarc and B. Wysocka)
Order, 1996, vol. 13, no. 2, pg. 119  134
 On Schur properties of random subsets of integers
(with R. L. Graham and A. Ruciński)
J. Number Theory, 1996, vol. 61, no. 2, pg. 388  408
 On induced Ramsey numbers for graphs with bounded maximum degree
(with T. Łuczak)
J. Combin. Theory Ser. B, 1996, vol. 66, no. 2, pg. 324  333
 Multicolored subsets in colored hypergraphs
(with H. Lefmann and B. Wysocka)
J. Combin. Theory Ser. A, 1996, vol. 74, no. 2, pg. 209  248
 Applications of hypergraph coloring to coloring graphs not inducing certain trees
(with H. A. Kierstead)
Discrete Math., 1996, vol. 150, no. 1  3, pg. 187  193
 Ramseytype results for oriented trees
(with Y. Kohayakawa and T. Łuczak)
J. Graph Theory, 1996, vol. 22, no. 1, pg. 1  8
 A remark on Pisier type theorems
(with P. Erdős and J. Nešetřil)
Congr. Numer., 1996, vol. 113, pg. 101  109
 Proper bounded edgecolorings (extended abstract)
(with C. BertramKretzberg, H. Lefmann and B. Wysocka)
First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science (1996, Auckland), Combinatorics, complexity and logic, Springer, Singapore, 1996, pg. 121  130
1995
 Threshold functions for Ramsey properties
(with A. Ruciński)
J. Amer. Math. Soc, 1995, vol. 8, no. 4, pg. 917  942
 Ramsey families which exclude a graph
(with N. Sauer and X. Zhu)
Combinatorica, 1995, vol. 15, no. 4, pg. 589  596
 Note on Ramsey numbers and selfcomplementary graphs
(with E. Šiňajová)
Math. Slovaca, 1995, vol. 45, no. 3, pg. 243  249
 A fast approximation algorithm for computing the frequencies of subgraphs in a given graph
(with R. Duke and H. Lefmann)
SIAM J. Comput., 1995, vol. 24, no. 3, pg. 598  620
 On the computational complexity of ordered subgraph recognition
(with D. Duffus and M. Ginn)
Random Structures \& Algorithms, 1995, vol. 7, no. 3, pg. 223  268
 Coverings of rgraphs by complete rpartite subgraphs
(with P. Erdős)
Random Structures \& Algorithms, 1995, vol. 6, no. 2  3, pg. 319  322
 On uncrowded hypergraphs
(with R. Duke and H. Lefmann)
Random Structures \& Algorithms, 1995, vol. 6, no. 2  3, pg. 209  212
 More on the complexity of cover graphs
(with J. Nešetřil)
Comment. Math. Univ. Carolin., 1995, vol. 36, no. 2, pg. 269  278
 On the jumping constant conjecture for multigraphs
(with A. Sidorenko)
J. Combin. Theory Ser. A, 1995, vol. 69, no. 2, pg. 347  357
 The minimum independence number for designs
(with D. A. Grable and K. T. Phelps)
Combinatorica, 1995, vol. 15, no. 2, pg. 175  185
 Shift graphs and lower bounds on Ramsey numbers r_k(l;r)
(with D. Duffus and H. Lefmann)
Discrete Math., 1995, vol. 137, no. 1  3, pg. 177  187
 On the genus of a random graph
(with R. Thomas)
Random Structures \& Algorithms, 1995, vol. 6, no. 1, pg. 1  12
 Dense graphs without 3regular subgraphs
(with L. Pyber and E. Szemerédi)
J. Combin. Theory Ser. B, 1995, vol. 63, no. 1, pg. 41  54
 On Ramsey sets in spheres
(with J. Matoušek)
J. Combin. Theory Ser. A, 1995, vol. 70, no. 1, pg. 30  44
 On ErdősRado numbers
(with H. Lefmann)
Combinatorica, 1995, vol. 15, no. 1, pg. 85  104
 The complexity of cover graph recognition for some varieties of finite lattices
(with L. Thoma)
Order, 1995, vol. 12, no. 4, pg. 351  374
1994
 Note on independent sets in Steiner systems
(with E. Šiňajová)
Random Structures \& Algorithms, 1994, vol. 5, no. 1, pg. 183  190
 Random graphs with monochromatic triangles in every edge coloring
(with A. Ruciński)
Random Structures \& Algorithms, 1994, vol. 5, no. 2, pg. 253  270
 The ErdősKoRado theorem for small families
(with R. Duke)
J. Combin. Theory Ser. A, 1994, vol. 65, no. 2, pg. 246  251
 Unbalanced Steiner triple systems
(with L. Haddad)
J. Combin. Theory Ser. A, 1994, vol. 66, no. 1, pg. 1  16
 The algorithmic aspects of the regularity lemma
(with N. Alon, R. Duke, H. Lefmann and R. Yuster)
J. Algorithms, 1994, vol. 16, no. 1, pg. 80  109
 Some combinatorialalgebraic problems from complexity theory
(with P. Pudlák)
Discrete Math., 1994, vol. 136, no. 1  3, pg. 253  279
1993
 Modified ranks of tensors and the size of circuits
(with P. Pudlák)
25th ACM Symposium on the Theory of Computing, STOC (1993, Chicago, IL), 1993, pg. 523  531
 Folkman numbers for graphs of small order
(with J. I. Brown)
Ars Combin., 1993, vol. 35, pg. 11  27
 Corrigendum: "Complexity of diagrams"
(with J. Nešetřil)
Order, 1993, vol. 10, pp. 393
 Monochromatic trees with respect to edge partitions
(with B. Voigt)
J. Combin. Theory Ser. B, 1993, vol. 58, no. 2, pg. 291  298
 Finite induced graph Ramsey theory: on partitions of subgraphs
(with D. S. Gunderson and N. Sauer)
J. Combin. Theory Ser. B, 1993, vol. 59, no. 2, pg. 199  209
 On isomorphic subgraphs
(with R. J. Gould)
Discrete Math., 1993, vol. 118, no. 1  3, pg. 259  262
 2colorings of complete graphs with a small number of monochromatic K4 subgraphs
(with F. Franěk)
Discrete Math. 114 (1993), no. 13, 199203, Combinatorics and algorithms (Jerusalem, 1988)., 1993, pg. 199  203
 Extremal problems for triple systems
(with H. Lefmann and K. T. Phelps)
J. Combin. Designs, 1993, vol. 1, no. 5, pg. 379  394
 On canonical Ramsey numbers for complete graphs versus paths
(with H. Lefmann)
J. Combin. Theory Ser. B, 1993, vol. 58, no. 1, pg. 1  13
 Rigid linear binary codes
(with H. Lefmann and K. T. Phelps)
J. Combin. Theory Ser. A, 1993, vol. 63, no. 1, pg. 110  128
 Lower bounds on probability thresholds for Ramsey properties
(with A. Ruciński)
Combinatorics, Paul Erdős is eighty, Vol. 1, 1993, pg. 317  346
 On canonical Ramsey numbers for coloring threeelement sets
(with H. Lefmann)
Finite and infinite combinatorics in sets and logic (1991, Banff, Alberta), Kluwer Acad. Publ., Dordrecht, 1993, pg. 237  247
1992
 Z. Frolík, his life and work
(with B. Balcar, J. Nešetřil, J. Pelant and P. Simon)
Topics in Discrete Mathematics: Topological, algebraical and combinatorial structures, 1992, pg. 17  22
 The algorithmic aspects of the regularity lemma
(with N. Alon, R. Duke, H. Lefmann and R. Yuster)
The 33th Annual Symposium on Foundations of Computer Science, FOCS (1992, Pittsburgh, PA), 1992, pg. 473  481
 On the complexity of coloring areflexive relations
(with L. Haddad)
Ars Combin., 1992, vol. 33, pg. 217  225
 The Ramsey property for families of graphs which exclude a given graph
(with N. Sauer)
Canad. J. Math., 1992, vol. 44, no. 5, pg. 1050  1060
 Monochromatic vs multicolored paths
(with H. Lefmann and R. Thomas)
Graphs Combin., 1992, vol. 8, no. 4, pg. 323  332
 The uniformity lemma for hypergraphs
(with P. Frankl)
Graphs Combin., 1992, vol. 8, no. 4, pg. 309  312
 Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
(with F. Franěk)
Graphs Combin., 1992, vol. 8, no. 4, pg. 299  308
 A canonical Ramsey theorem
(with N. Eaton)
Random Structures \& Algorithms, 1992, vol. 3, no. 4, pg. 427  444
 Rainbow subgraphs in properly edgecolored graphs
(with Z. Tuza)
Random Structures \& Algorithms, 1992, vol. 3, no. 2, pg. 175  182
 A combinatorial approach to complexity
(with P. Pudlák)
Combinatorica, 1992, vol. 12, no. 2, pg. 221  226
 Cycleconnected graphs
(with R. Duke and P. Erdős)
Discrete Math., 1992, vol. 108, no. 1  3, pg. 261  278
 On coverings of infinitedimensional metric spaces
(with J. Pelant)
Discrete Math., 1992, vol. 108, no. 1  3, pg. 75  81
 On Ramsey graphs without bipartite subgraphs
(with J. Nešetřil)
Discrete Math., 1992, vol. 101, no. 1  3, pg. 223  229
 Coloring ordered sets to avoid monochromatic maximal chains
(with D. Duffus, N. Sauer and R. Woodrow)
Canad. J. Math., 1992, vol. 44, no. 1, pg. 91  103
 Enumeration of order preserving maps
(with D. Duffus, B. Sands and R. Woodrow)
Order, 1992, vol. 9, no. 1, pg. 15  29
 On embedding of graphs into Euclidean spaces of small dimension
(with J. Reiterman and E. Šiňajová)
J. Combin. Theory Ser. B, 1992, vol. 56, no. 1, pg. 1  8
 Interval orders and shift graphs
(with Z. Füredi, P. Hajnal and W. T. Trotter)
Sets, graphs and numbers (1991, Budapest), Colloq. Math. Soc. János Bolyai, 60, NorthHolland, Amsterdam, 1992, pg. 297  313
 On an antiRamsey type result
(with N. Alon and H. Lefmann)
Sets, graphs and numbers (1991, Budapest), Colloq. Math. Soc. János Bolyai, 60, NorthHolland, Amsterdam, 1992, pg. 9  22
1991
 The number of twise balanced designs
(with C. J. Colbourn, D. G. Hoffman, K. T. Phelps and P. M. Winkler)
Combinatorica, 1991, vol. 11, no. 3, pg. 207  218
 A Ramsey type problem concerning vertex colourings
(with J. I. Brown)
J. Combin. Theory Ser. B, 1991, vol. 52, no. 1, pg. 45  52
 Extremal problems for cycleconnected graphs
(with R. Duke and P. Erdős)
Twentysecond Southeastern Conference on Combinatorics, Graph Theory, and Computing (1991, Baton Rouge, LA), 1991, pg. 147  151
 Monochromatic solutions to equations with unit fractions
(with T. C. Brown)
Bull. Austral. Math. Soc., 1991, vol. 43, no. 3, pg. 387  392
 Bounds on the number of isolated vertices in sum graphs
(with R. J. Gould)
Graph theory, combinatorics and applications (1988, Kalamazoo, MI), Wiley, New York, 1991, pg. 553  562
1990
 A partition property of simplices in Euclidean space
(with P. Frankl)
J. Amer. Math. Soc, 1990, vol. 3, no. 1, pg. 1  7
 Some developments in Ramsey theory
International Congress of Mathematicians, ICM (1990, Kyoto), 1990, pg. 1455  1466
 Lower bounds to the complexity of symmetric Boolean functions
(with L. Babai, P. Pudlák and E. Szemerédi)
Theoret. Comput. Sci., 1990, vol. 74, no. 3, pg. 313  323
 On Pisier type problems and results (combinatorial applications to number theory)
(with P. Erdős and J. Nešetřil)
Algorithms and Combinatorics: Mathematics of Ramsey theory, 1990, pg. 214  231
 Partite construction and Ramsey space systems
(with J. Nešetřil)
Algorithms and Combinatorics: Mathematics of Ramsey theory, 1990, pg. 98  112
 Some results in finite graph Ramsey theory
(with D. S. Gunderson and N. Sauer)
Twentyfirst Southeastern Conference on Combinatorics, Graph Theory and Computing (1990, Boca Raton, FL), 1990, pg. 232  243
 A new construction of kFolkman graphs
(with J. I. Brown)
Ars Combin., 1990, vol. 29, pg. 265  269
 On the dimension to represent a graph by a unit distance graph
(with H. Maehara)
Graphs Combin., 1990, vol. 6, no. 4, pg. 365  367
 Quantitative Versionen von kombinatorischen Partitionssätzen
(with P. Frankl and R. L. Graham)
Jahresber. Deutsch. Math.Verein., 1990, vol. 92, no. 3, pg. 130  144
 On Ramsey families of sets
Graphs Combin., 1990, vol. 6, no. 2, pg. 187  195
 Iterated combinatorial density theorems
(with P. Frankl and R. L. Graham)
J. Combin. Theory Ser. A, 1990, vol. 54, no. 1, pg. 95  111
1989
 Embeddings of graphs in Euclidean spaces
(with J. Reiterman and E. Šiňajová)
Discrete Comput. Geom., 1989, vol. 4, no. 4, pg. 349  364
 A Ramseytype theorem for orderings of a graph
(with P. M. Winkler)
SIAM J. Discrete Math., 1989, vol. 2, no. 3, pg. 402  406
 Geometrical embeddings of graphs
(with J. Reiterman and E. Šiňajová)
Discrete Math., 1989, vol. 74, no. 3, pg. 291  319
 Chromatically optimal rigid graphs
(with J. Nešetřil)
J. Combin. Theory Ser. B, 1989, vol. 46, no. 2, pg. 133  141
 The partite construction and Ramsey set systems
(with J. Nešetřil)
Discrete Math., 1989, vol. 75, no. 1  3, pg. 327  334
 Percentages in pairwise balanced designs
(with C. J. Colbourn)
Discrete Math., 1989, vol. 77, no. 1  3, pg. 57  63
 On the distribution of monochromatic configurations
(with P. Frankl and R. L. Graham)
Colloquium on Irregularities of Partitions (1986, Fertőd), Springer, Berlin, 1989, pg. 71  87
1988
 Graph complexity
(with P. Pudlák and P. Savický)
Acta Inform., 1988, vol. 25, no. 5, pg. 515  535
 Some RamseyTurán type results for hypergraphs
(with P. Frankl)
Combinatorica, 1988, vol. 8, no. 4, pg. 323  332
 The number of submatrices of a given type in a Hadamard matrix and related results
(with P. Frankl and R. M. Wilson)
J. Combin. Theory Ser. B, 1988, vol. 44, no. 3, pg. 317  328
 Quantitative theorems for regular systems of equations
(with P. Frankl and R. L. Graham)
J. Combin. Theory Ser. A, 1988, vol. 47, no. 2, pg. 246  261
 Tournament ranking with expected profit in polynomial time
(with S. Poljak and J. Spencer)
SIAM J. Discrete Math., 1988, vol. 1, no. 3, pg. 372  376
 Ultrafilters on ω and atoms in the lattice of uniformities. II
(with J. Pelant, J. Reiterman and P. Simon)
Topology Appl., 1988, vol. 30, no. 2, pg. 107  125
 Ultrafilters on ω and atoms in the lattice of uniformities. I
(with J. Pelant, J. Reiterman and P. Simon)
Topology Appl., 1988, vol. 30, no. 1, pg. 1  17
 Embedding of trees in Euclidean spaces
(with H. Maehara, J. Reiterman and E. Šiňajová)
Graphs Combin., 1988, vol. 4, no. 1, pg. 43  47
1987
 Small spaces with large point character
European J. Combin., 1987, vol. 8, no. 1, pg. 55  58
 Strong Ramsey theorems for Steiner systems
(with J. Nešetřil)
Trans. Amer. Math. Soc., 1987, vol. 303, no. 1, pg. 183  192
 Forbidden intersections
(with P. Frankl)
Trans. Amer. Math. Soc., 1987, vol. 300, no. 1, pg. 259  286
 Complexity of diagrams
(with J. Nešetřil)
Order, 1987, vol. 3, no. 4, pg. 321  330
 Partite construction and Ramseyan theorems for sets, numbers and spaces
(with J. Nešetřil)
Comment. Math. Univ. Carolin., 1987, vol. 28, no. 3, pg. 569  580
 A note on ranking functions
(with W. T. Trotter)
Discrete Math., 1987, vol. 67, no. 3, pg. 307  309
 Multiple optima in local search
(with C. Tovey)
J. Algorithms, 1987, vol. 8, no. 2, pg. 250  259
 Local kcolorings of graphs and hypergraphs
(with A. Gyárfás, J. Lehel, J. Nešetřil, R. H. Schelp and Z. Tuza)
J. Combin. Theory Ser. B, 1987, vol. 43, no. 2, pg. 127  139
 Large trees in random graphs
(with L. Kučera)
Comment. Math. Univ. Carolin., 1987, vol. 28, no. 1, pg. 7  14
 On subsets of abelian groups with no 3term arithmetic progression
(with P. Frankl and R. L. Graham)
J. Combin. Theory Ser. A, 1987, vol. 45, no. 1, pg. 157  161
 Induced restricted Ramsey theorems for spaces
(with P. Frankl and R. L. Graham)
J. Combin. Theory Ser. A, 1987, vol. 44, no. 1, pg. 120  128
 Numbers in Ramsey theory
(with R. L. Graham)
11th British Combinatorial Conference (1987, London), Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 123, Cambridge Univ. Press, Cambridge, 1987, pg. 111  153
1986
 Two lower bounds for branching programs
(with M. Ajtai, L. Babai, P. Hajnal, J. Komlós, P. Pudlák, E. Szemerédi and G. Turán)
18th Annual ACM Symposium on Theory of Computing, STOC (1986, Berkley, LA), 1986, pg. 30  38
 All triangles are Ramsey
(with P. Frankl)
Trans. Amer. Math. Soc., 1986, vol. 297, no. 2, pg. 777  779
 Steiner triple systems with minimum independence number
(with K. T. Phelps)
Ars Combin., 1986, vol. 21, pg. 167  172
 Finite union theorem with restrictions
(with J. Nešetřil)
Graphs Combin., 1986, vol. 2, no. 4, pg. 357  361
 On sets of integers with the Schur property
(with J. Nešetřil)
Graphs Combin., 1986, vol. 2, no. 3, pg. 269  275
 On hereditarily rigid algebras
(with V. Koubek)
Algebra Universalis, 1986, vol. 22, no. 2  3, pg. 120  141
 Large trianglefree subgraphs in graphs without K4
(with P. Frankl)
Graphs Combin., 1986, vol. 2, no. 2, pg. 135  144
 The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
(with P. Erdős and P. Frankl)
Graphs Combin., 1986, vol. 2, no. 2, pg. 113  121
 On universality of graphs with uniformly distributed edges
Discrete Math., 1986, vol. 59, no. 1  2, pg. 125  134
 Coloring graphs with locally few colors
(with P. Erdős, Z. Füredi, P. Hajnal, P. Komjáth and A. Seress)
Discrete Math., 1986, vol. 59, no. 1  2, pg. 21  34
 Coloring of universal graphs
(with P. Komjáth)
Graphs Combin., 1986, vol. 2, no. 1, pg. 55  60
 An elementary proof of the canonizing version of GallaiWitt's theorem
(with H. J. Prömel)
J. Combin. Theory Ser. A, 1986, vol. 42, no. 1, pg. 144  149
 Note on decomposition of spheres in Hilbert spaces
(with D. Preiss)
J. Combin. Theory Ser. A, 1986, vol. 43, no. 1, pg. 38  44
1985
 Geometrical realization of set systems and probabilistic communication complexity
(with N. Alon and P. Frankl)
The 26th Annual Symposium on Foundations of Computer Science, FOCS (1985, Portland, OR), 1985, pg. 277  280
 Two proofs in combinatorial number theory
(with J. Nešetřil)
Proc. Amer. Math. Soc., 1985, vol. 93, no. 1, pg. 185  188
 Near perfect coverings in graphs and hypergraphs
(with P. Frankl)
European J. Combin., 1985, vol. 6, no. 4, pg. 317  326
 Two remarks on Ramsey's theorem
(with J. Nešetřil)
Discrete Math., 1985, vol. 54, no. 3, pg. 339  341
 Note on a RamseyTurán type problem
Graphs Combin., 1985, vol. 1, no. 3, pg. 291  293
 Lower bounds for Turán's problem
(with P. Frankl)
Graphs Combin., 1985, vol. 1, no. 3, pg. 213  216
 On color critical graphs
(with Z. Tuza)
J. Combin. Theory Ser. B, 1985, vol. 38, no. 3, pg. 204  213
 Note on the number of monoids of order n
(with V. Koubek)
Comment. Math. Univ. Carolin., 1985, vol. 26, no. 2, pg. 309  314
 Threshold hypergraphs
(with J. Reiterman, E. Šiňajová and M. Tůma)
Discrete Math., 1985, vol. 54, no. 2, pg. 193  200
 Canonizing ordering theorems for HalesJewett structures
(with J. Nešetřil, H. J. Prömel and B. Voigt)
J. Combin. Theory Ser. A, 1985, vol. 40, no. 2, pg. 394  408
 On the use of senders in generalized Ramsey theory for graphs
(with S. A. Burr and J. Nešetřil)
Discrete Math., 1985, vol. 54, no. 1, pg. 1  13
 On graphs with small subgraphs of large chromatic number
(with R. Duke)
Graphs Combin., 1985, vol. 1, no. 1, pg. 91  96
 On a packing and covering problem
European J. Combin., 1985, vol. 6, no. 1, pg. 69  78
 Three remarks on dimensions of graphs
(with J. Nešetřil)
1st Poznan Seminar on Random Graphs (1983, Poznań), NorthHolland, Amsterdam, 1985, pg. 199  207
1984
 More results on subgraphs with many short cycles
(with R. Duke and P. Erdős)
Fifteenth Southeastern conference on combinatorics, graph theory and computing (1984, Baton Rouge, LA), Congr. Numer., 1984, pg. 295  300
 On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
(with K. T. Phelps)
Combinatorica, 1984, vol. 4, no. 1, pg. 79  88
 Note on canonizing ordering theorems for Hales Jewett structures
(with J. Nešetřil, H. J. Prömel and B. Voigt)
11th winter school on abstract analysis (1983, Železná Ruda), 1984, pg. 191  196
 Steiner triple systems with small maximal independent sets
(with M. D. Brandes)
Ars Combin., 1984, vol. 17, pg. 15  19
 On combinatorial properties of spheres in Euclidean spaces
Combinatorica, 1984, vol. 4, no. 4, pg. 345  349
 Block sizes in pairwise balanced designs
(with C. J. Colbourn and K. T. Phelps)
Canad. Math. Bull., 1984, vol. 27, no. 3, pg. 375  380
 Hypergraphs do not jump
(with P. Frankl)
Combinatorica, 1984, vol. 4, no. 2  3, pg. 149  159
 How to build a barricade
(with P. Frankl and J. Pach)
Monatsh. Math., 1984, vol. 98, no. 2, pg. 93  98
 On the minimum order of graphs with given semigroup
(with V. Koubek)
J. Combin. Theory Ser. B, 1984, vol. 36, no. 2, pg. 135  155
 Combinatorial partitions of finite posets and latticesRamsey lattices
(with J. Nešetřil)
Algebra Universalis, 1984, vol. 19, no. 1, pg. 106  119
 Sparse Ramsey graphs
(with J. Nešetřil)
Combinatorica, 1984, vol. 4, no. 1, pg. 71  78
 Selectivity of hypergraphs
(with P. Erdős and J. Nešetřil)
Finite and infinite sets (1981, Eger), NorthHolland, Amsterdam, 1984, pg. 265  284
1983
 Ramsey classes of set systems
(with J. Nešetřil)
J. Combin. Theory Ser. A, 1983, vol. 34, no. 2, pg. 183  201
 On the achromatic number of simple hypergraphs
(with J. Nešetřil and K. T. Phelps)
Ars Combin., 1983, vol. 16, pg. 95  102
 On a product dimension of bipartite graphs
(with S. Poljak and A. Pultr)
J. Graph Theory, 1983, vol. 7, no. 4, pg. 475  486
 The Ramsey number of a graph with bounded maximum degree
(with V. Chvátal, E. Szemerédi and W. T. Trotter)
J. Combin. Theory Ser. B, 1983, vol. 34, no. 3, pg. 239  243
 On qualitatively independent partitions and related problems
(with S. Poljak and A. Pultr)
Discrete Appl. Math., 1983, vol. 6, no. 2, pg. 193  205
 On classes of graphs determined by forbidden subgraphs
(with S. Poljak)
Czechoslovak Math. J., 1983, vol. 33(108), no. 1, pg. 27  33
 On a problem in combinatorial geometry
Discrete Math., 1983, vol. 45, no. 1, pg. 129  131
 Another proof of the FolkmanRadoSanders theorem
(with J. Nešetřil)
J. Combin. Theory Ser. A, 1983, vol. 34, no. 1, pg. 108  109
 Generalized Ramsey theory for graphs. XIV. Induced Ramsey numbers
(with F. Harary and J. Nešetřil)
Graphs and other combinatorial topics (1982, Prague), Teubner, Leipzig, 1983, pg. 90  100
 On some problems related to partitions of edges of a graph
(with P. Erdős and J. Nešetřil)
Graphs and other combinatorial topics (1982, Prague), Teubner, Leipzig, 1983, pg. 54  63
 Uniform spaces (selected topics)
(with Z. Frolík, M. Hušek, J. Pelant and J. Vilímovský)
General topology and its relations to modern analysis and algebra (1981, Prague), Heldermann, Berlin, 1983, pg. 206  214
 Products of graphs and their applications
(with J. Nešetřil)
Graph theory (1981, Łagów), Springer, Berlin, 1983, pg. 151  160
1982
 Coloring Steiner triple systems
(with M. D. Brandes and K. T. Phelps)
SIAM J. Algebraic Discrete Methods, 1982, vol. 3, no. 2, pg. 241  249
 Note on packing, covering and Turán numbers
10th Winter School on Abstract Analysis (1982, Srní), 1982, pg. 263  265
 Canonical ordering theorems, a first attempt
(with J. Nešetřil, H. Prömel and B. Voigt)
10th Winter School on Abstract Analysis (1982, Srní), Rend. Circ. Mat. Palermo (2), 1982, pg. 193  197
 Two proofs of the Ramsey property of the class of finite hypergraphs
(with J. Nešetřil)
European J. Combin., 1982, vol. 3, no. 4, pg. 347  352
 Nearly bipartite graphs with large chromatic number
Combinatorica, 1982, vol. 2, no. 4, pg. 377  383
 Coloring block designs is NPcomplete
(with C. J. Colbourn, M. J. Colbourn and K. T. Phelps)
SIAM J. Algebraic Discrete Methods, 1982, vol. 3, no. 3, pg. 305  307
 Colouring Steiner quadruple systems
(with C. J. Colbourn, M. J. Colbourn and K. T. Phelps)
Discrete Appl. Math., 1982, vol. 4, no. 2, pg. 103  111
 Monotone paths in ordered graphs
(with V. Müller)
Combinatorica, 1982, vol. 2, no. 2, pg. 193  201
 A note on finite Boolean algebras
Acta Polytech. ČVUT Praha, 1982, vol. 1982, no. 1, pg. 47  50
 Note on threshold hypergraphs
(with J. Reiterman, E. Šiňajová and M. Tůma)
Acta Polytech. ČVUT Praha, 1982, vol. 1982, no. 1, pg. 39  46
 On coverings of random graphs
(with M. Ajtai, J. Komlós and E. Szemerédi)
Comment. Math. Univ. Carolin., 1982, vol. 23, no. 1, pg. 193  198
 Partition theorems for systems of finite subsets of integers
(with P. Pudlák)
Discrete Math., 1982, vol. 39, no. 1, pg. 67  73
1981
 A note on universal graphs
Ars Combin., 1981, vol. 11, pg. 225  229
 On number of covering arcs in orderings
(with V. Koubek)
Comment. Math. Univ. Carolin., 1981, vol. 22, no. 4, pg. 721  733
 Complexity of representation of graphs by set systems
(with S. Poljak and D. Turzík)
Discrete Appl. Math., 1981, vol. 3, no. 4, pg. 301  312
 On set systems determined by intersections
(with S. Poljak)
Discrete Math., 1981, vol. 34, no. 2, pg. 173  184
 On the arcchromatic number of a digraph
(with S. Poljak)
J. Combin. Theory Ser. B, 1981, vol. 31, no. 2, pg. 190  198
 Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
(with J. Nešetřil)
Combinatorica, 1981, vol. 1, no. 2, pg. 199  202
 Fast recognition of rings and lattices
(with P. Goralčík, A. Goralčíková and V. Koubek)
Fundamentals of computation theory, FTC (1981, Szeged), Springer, Berlin, 1981, pg. 137  145
 On the dimension of Kneser graphs
(with S. Poljak and A. Pultr)
Algebraic methods in graph theory (1978, Szeged), NorthHolland, Amsterdam, 1981, pg. 631  646
1980
 Atoms in uniformities
(with J. Reiterman)
Pokroky Mat. Fyz. Astronom., 1980, vol. 25, no. 4, pg. 208  217
 Orthogonal partitions and covering of graphs
(with S. Poljak)
Czechoslovak Math. J., 1980, vol. 30(105), no. 3, pg. 475  485
1979
 On nonzero dimensional atoms
(with J. Reiterman)
7th Winter School on Abstract Analysis (1976, Prague), 1979, pg. 67  78
 On Ramsey graphs without cycles of short odd lengths
(with J. Nešetřil)
Comment. Math. Univ. Carolin., 1979, vol. 20, no. 3, pg. 565  582
 Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs
(with J. Nešetřil)
Czechoslovak Math. J., 1979, vol. 29(104), no. 2, pg. 202  218
 A short proof of the existence of highly chromatic hypergraphs without short cycles
(with J. Nešetřil)
J. Combin. Theory Ser. B, 1979, vol. 27, no. 2, pg. 225  227
 Partition theory and its application
(with J. Nešetřil)
7th British Combinatorial Conference (1979, Cambridge), London Math. Soc. Lecture Note Ser. 38, Cambridge Univ. Press, New York, 1979, pg. 96  156
1978
 The structure of critical Ramsey graphs
(with J. Nešetřil)
Acta Math. Acad. Sci. Hungar., 1978, vol. 32, no. 3  4, pg. 295  300
 Selective graphs and hypergraphs
(with J. Nešetřil)
Ann. Discrete Math., 1978, vol. 3, pg. 181  189
 On a probabilistic graphtheoretical method
(with J. Nešetřil)
Proc. Amer. Math. Soc., 1978, vol. 72, no. 2, pg. 417  421
 On systems of graphs intersecting in paths
Comment. Math. Univ. Carolin., 1978, vol. 19, no. 1, pg. 135  140
 A simple proof of the GalvinRamsey property of the class of all finite graphs and a dimension of a graph
(with J. Nešetřil)
Discrete Math., 1978, vol. 23, no. 1, pg. 49  55
 Partition (Ramsey) theory  a survey
(with J. Nešetřil)
Fifth Hungarian Colloquium on Combinatorics (1976, Keszthely), NorthHolland, Amsterdam, 1978, pg. 759  792
 A selective theorem for graphs and hypergraphs
(with J. Nešetřil)
Problèmes combinatoires et théorie des graphes (1976, Paris), CNRS, Paris, 1978, pg. 309  311
 On ramsey minimal graphs
(with J. Nešetřil)
Problèmes combinatoires et théorie des graphes (1976, Paris), CNRS, Paris, 1978, pg. 307  308
1977
 On the chromatic number of subgraphs of a given graph
Proc. Amer. Math. Soc., 1977, vol. 64, no. 2, pg. 370  371
 A structural generalization of the Ramsey theorem
(with J. Nešetřil)
Bull. Amer. Math. Soc., 1977, vol. 83, no. 1, pg. 127  128
 Some problems concerned with chromatic numbers of graphs and hypergraphs
(with J. Nešetřil)
Beiträge zur Graphentheorie und deren Anwendungen (1977, Oberhof), 1977, pg. 189  193
 On critical 3chromatic hypergraphs
(with V. Müller and D. Turzík)
Acta Math. Acad. Sci. Hungar., 1977, vol. 29, no. 3  4, pg. 273  281
 Partitions of finite relational and set systems
(with J. Nešetřil)
J. Combin. Theory Ser. A, 1977, vol. 22, no. 3, pg. 289  312
 Ramsey topological spaces
(with J. Nešetřil)
General topology and its relations to modern analysis and algebra, IV (1976, Prague), 1977, pg. 333  337
 Canonical partition relations and point character of l1 spaces
Seminar on Uniform Spaces (Prague, 197677), 1977, pg. 79  81
 A nonzero dimensional atom
(with J. Reiterman)
Seminar on Uniform Spaces (Prague, 197677), 1977, pg. 65  74
1976
 A generalization of the Ramsey theorem
Graphs, Hypergraphs, and Block Systems (1976, Zielona Gora), 1976, pg. 211  219
 Ramsey characterization theorem for classes of structures II
(with J. Nešetřil)
Graphs, Hypergraphs, and Block Systems (1976, Zielona Gora), 1976, pg. 181  186
 Ramsey characterization theorem for classes of structures I
(with J. Nešetřil)
Graphs, Hypergraphs, and Block Systems (1976, Zielona Gora), 1976, pg. 173  179
 Van der Waerden theorem for sequences of integers not containing an arithmetic progression of k terms
(with J. Nešetřil)
Comment. Math. Univ. Carolin., 1976, vol. 17, no. 4, pg. 675  681
 The Ramsey property for graphs with forbidden complete subgraphs
(with J. Nešetřil)
J. Combin. Theory Ser. B, 1976, vol. 20, no. 3, pg. 243  249
 Partitions of vertices
(with J. Nešetřil)
Comment. Math. Univ. Carolin., 1976, vol. 17, no. 1, pg. 85  95
1975
 Partitions of subgraphs
(with J. Nešetřil)
Recent advances in graph theory (1975, Prague), Academia, 1975, pg. 413  423
 Fineness in the category of all 0dimensional uniform spaces
Seminar on Uniform Spaces (Prague, 197374), 1975, pg. 139  143
 Ramsey graph without triangles exists for any graph without triangles
(with J. Nešetřil)
Infinite and finite sets (1973, Keszthely), Colloq. Math. Soc. Janos Bolyai, Vol. 10, NorthHolland, Amsterdam, 1975, pg. 1127  1132
1974
 Representing of groups and semigroups by products in categories of relations
(with V. Koubek and J. Nešetřil)
Algebra Universalis, 1974, vol. 4, pg. 336  341
 Type theory of partition properties of graphs
(with J. Nešetřil)
Recent advances in graph theory (1974, Prague), Academia, 1974, pg. 405  412
1973
 On generating of relations
(with J. Pelant)
Comment. Math. Univ. Carolin., 1973, vol. 14, pg. 95  105

