Vojtěch Rödl
Vojtěch Rödl
Department of Mathematics and Computer Science, Emory University

Publications

2016
  1. An Algorithmic Hypergraph Regularity Lemma (with B. Nagle and M. Schacht) Proc. of 27th ACM-SIAM Symp. on Discrete Algorithm, 2016, vol. 1, pg. 1765 - 1773
  2. On the number of B_h-sets (with D. Dellamonica, Y. Kohayakawa, S. Lee and W. Samotij) Combin. Probab. Comput., 2016, vol. 25(1), pg. 108 - 129
  3. Hypergraph Ramsey numbers: tight cycles versus cliques (with D. Mubayi) Bull. London Math. Soc., 2016, vol. 48(1), pg. 127 - 134
  4. A note on supersaturated set systems (with P. Frankl and Y. Kohayakawa) European J. Combin., 2016, vol. 51, pg. 190 - 199
  5. A Short Proof of the Induced Ramsey Theorem for Hypergraphs (with V. Bhat) Discrete Math., 2016, vol. 339(3), pg. 1147 - 1149
  6. An Induced Ramsey Theorem for k-partite, k-uniform Hypergraphs (with D. Dellamonica and S. La Fleur) Random Structures \& Algorithms, 2016, vol. 48(1), pg. 5 - 20
2015
  1. Ramsey-type numbers of hypergraphs (with H. Han, T. Retter and M. Schacht) Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS (2015, Fortaleza), Electronic Notes Discrete Mathematics, Fortaleza, Brazil, 2015, pg. 457 - 463
  2. Quasi-randomness and the regularity method in hypergraphs Volume I (Plenary Lectures) International Congress of Mathematicians, ICM (2015), 2015, pg. 571 - 599
  3. 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
  4. An optimal algorithm for computing Frieze-Kannan regular partitions (with D. Dellamonica, S. Kalyanasundaram, D. Martin and A. Shapira) Combin. Probab. Comput., 2015, vol. 24, no. 2, pg. 407 - 437
  5. 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
  1. 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
  2. On generalized shift graphs (with C. Avart and T. Łuczak) Fundamenta Mathematicae, 2014, vol. 226, no. 2, pg. 173 - 199
  3. 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
  4. Families of triples with high minimum degree are Hamiltonian (with A. Ruciński) Disscuss. Math., 2014, vol. 34, pg. 363 - 383
  5. Degree Ramsey Numbers of Closed Blowups of Trees (with P. Horn and K. Milans) Electron. J. Combin., 2014, vol. 21, no. 2, pp. 6
  6. Specified Intersections (with D. Mubayi) Trans. Amer. Math. Soc., 2014, vol. 366, no. 1, pg. 491 - 504
2013
  1. Extremal results in random graphs (with M. Schacht) Erdos Centennial, 2013, pg. 535 - 584
  2. 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
  3. Jumps and Non-jumps in Multigraphs (with P. Horn and S. La Fleur) SIAM J. Discrete Math., 2013, vol. 27, no. 2, pg. 1040 - 1054
  4. Note on Upper Density of Quasi-random Hypergraphs (with V. Bhat) Electron. J. Combin., 2013, vol. 20, no. 2, pg. 1 - 8
  5. Some recent results on Ramsey-type numbers (with A. Dudek and P. Frankl) Discrete Appl. Math., 2013, vol. 161, no. 9, pg. 1197 - 1202
  6. Note on the point character of l1-spaces (with C. Avart and P. Komjáth) Periodica Mathematica Hungarica, 2013, vol. 66, no. 2, pg. 181 - 192
  7. 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
  1. 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
  2. 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
  3. Complete partite subgraphs in relatively dense hypergraphs (with M. Schacht) Random Structures \& Algorithms, 2012, vol. 41, no. 4, pg. 557 - 573
  4. 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
  5. A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma (with D. Dellamonica, S. Kalyanasundaram, D. Martin and A. Shapira) SIAM J. Discrete Math., 2012, vol. 26(1), pg. 15 - 29
  6. Universality of Random Graphs (with D. Dellamonica, Y. Kohayakawa and A. Ruciński) SIAM J. Discrete Math., 2012, vol. 26(1), pg. 353 - 374
  7. On trees and near vertex-regularity (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
  8. On even-degree 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
  9. Distance preserving Ramsey graphs (with D. Dellamonica) Combin. Probab. Comput., 2012, vol. 21, no. 4, pg. 554 - 581
  10. On induced Folkman numbers (with A. Dudek and R. Ramadurai) Random Structures \& Algorithms, 2012, vol. 40, no. 4, pg. 493 - 500
2011
  1. A Deterministic Algorithm for the Frieze-Kannan 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
  2. The maximum size of a Sidon set contained in a sparse random set of integers (with Y. Kohayakawa and S. Lee) SODA, ACM-SIAM Symposium on Discrete Algorithms (2011, San Francisco, CA), 2011, pg. 159 - 171
  3. A note on Thomassen's conjecture (with D. Dellamonica) J. Combin. Theory Ser. B, 2011, vol. 101, no. 6, pg. 509 - 515
  4. On a conjecture of Thomassen (with D. Dellamonica, V. Koubek and D. Martin) J. Graph Theory, 2011, vol. 67, no. 4, pg. 316 - 331
  5. On the function of Erdos and Rogers (with A. Dudek) Ramsey Theory, Progr. Math. - vol. 285, 2011, pg. 63 - 76
  6. 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
  7. 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
  8. Hereditary quasirandom properties of hypergraphs (with D. Dellamonica) Combinatorica, 2011, vol. 31, no. 2, pg. 165 - 182
  9. Dirac-type condition for hamiltonian paths and cycles in 3-uniform hypergraphs (with A. Ruciński and E. Szemerédi) Advances in Mathematics, 2011, vol. 227, pg. 1225 - 1299
  10. 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
  1. 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
  2. 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
  3. 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
  4. 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
  5. An almost quadratic bound on vertex Folkman Numbers (with A. Dudek) J. Combin. Theory Ser. B, 2010, vol. 100, no. 2, pg. 132 - 140
  6. On the number of graphs with a given endomorphism monoid (with V. Koubek) Discrete Math., 2010, vol. 310, no. 3, pg. 376 - 384
  7. 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
  8. Ramsey properties of random discrete structures (with E. Friedgut and M. Schacht) Random Structures \& Algorithms, 2010, vol. 37, no. 4, pg. 407 - 436
  9. 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
  10. 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
  11. Dirac-type 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
  12. 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
  13. Construction of sparse uniform hypergraphs with high chromatic number (with A. V. Kostochka) Random Structures \& Algorithms, 2010, vol. 36, no. 1, pg. 46 - 56
  14. Quasi-randomness and algorithmic regularity for graphs with general degree distributions (with N. Alon, A. Coja-Oghlan, H. Han, K. Mihyun and M. Schacht) SIAM J. Comput., 2010, vol. 39, no. 6, pg. 2336 - 2362
2009
  1. On graphs with a given endomorphism monoid (with V. Koubek and B. Shemmer) J. Graph Theory, 2009, vol. 62, no. 3, pg. 241 - 262
  2. Colorfull Flowers (with C. Avart, P. Komjáth and T. Łuczak) Topology Appl., 2009, vol. 156, no. 7, pg. 1386 - 1395
  3. 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
  4. Cliques in Steiner Systems (with A. Dudek and F. Franěk) Math. Slovaca, 2009, vol. 59, pg. 109 - 120
  5. 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
  6. 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
  7. Generalizations of the removal lemma (with M. Schacht) Combinatorica, 2009, vol. 29, no. 4, pg. 467 - 502
  8. 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
  9. Note on asymptotically good packings (with D. Martin) J. Combin. Designs, 2009, vol. 17, no. 6, pg. 448 - 455
  10. On k-chromatically connected graphs (with A. Dudek and E. Nastase) Discrete Math., 2009, vol. 309, no. 18, pg. 5547 - 5550
  11. 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
  12. Hypergraph regularity and quasi-randomness (with B. Nagle, A. Poerschke and M. Schacht) ACM-SIAM Symposium on Discrete Algorithms, SODA (2009), 2009, pg. 227 - 236
  13. 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
  14. 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
  1. 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
  2. Finding Folkman Numbers via MAX CUT Problem (with A. Dudek) Electron. Notes Discrete Math., 2008, vol. 30, pg. 99 - 104
  3. New Upper Bound on Vertex Folkman Numbers (with A. Dudek) Lecture Notes in Computer Science, 2008, vol. 4957, pg. 473 - 478
  4. 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
  5. On the Folkman Number f(2, 3, 4) (with A. Dudek) Experiment. Math., 2008, vol. 17(1), pg. 63 - 67
  6. Note on the 3-graph counting lemma (with B. Nagle and M. Schacht) Discrete Math., 2008, vol. 308, no. 19, pg. 4501 - 4517
  7. On Ramsey minimal graphs (with M. H. Siggers) SIAM J. Discrete Math., 2008, vol. 22, pg. 467 - 488
  8. On the Turán Properties of Infinite Graphs (with A. Dudek) Electron. J. Combin., 2008, vol. 15, no. 1, pg. 1 - 14
  9. On the Ramsey number of sparse 3-graphs (with B. Nagle, S. Olsen and M. Schacht) Graphs Combin., 2008, vol. 24, no. 3, pg. 205 - 228
  10. Triangulations and the Hajos conjecture (with J. Zich) J. Graph Theory, 2008, vol. 59, no. 4, pg. 293 - 325
  11. An approximate Dirac-type theorem for k-uniform hypergraphs (with A. Ruciński and E. Szemerédi) Combinatorica, 2008, vol. 28, no. 2, pg. 229 - 260
  12. 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 ACM-SIAM Symposium on Discrete Mathematics, SIAM, San Francisco, CA, 2008, pg. 782 - 788
2007
  1. 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
  2. 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
  3. 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
  4. 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
  5. Ramsey properties of random k-partite k-uniform hypergraphs (with A. Ruciński and M. Schacht) SIAM J. Discrete Math., 2007, vol. 21, no. 2, pg. 442 - 460
  6. 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
  7. Small subsets inherit sparse epsilon-regularity (with S. Gerke, Y. Kohayakawa and A. Steger) J. Combin. Theory Ser. B, 2007, vol. 97, no. 1, pg. 34 - 56
  8. Quasi-randomness and algorithmic regularity for graphs with general degree distributions (with N. Alon, A. Coja-Oghlan, 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
  9. Turán's theorem for pseudo-random 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
  10. Every monotone 3-graph property is testable (with C. Avart and M. Schacht) SIAM J. Discrete Math., 2007, vol. 21, pg. 73 - 92
  11. Regular partitions of hypergraphs: Regularity Lemmas (with M. Schacht) Combin. Probab. Comput., 2007, vol. 16, no. 6, pg. 833 - 885
  12. Regular partititions of hypergraphs: Counting Lemmas (with M. Schacht) Combin. Probab. Comput., 2007, vol. 16, no. 6, pg. 887 - 901
  13. 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
  1. 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
  2. The Counting Lemma for regular k-uniform hypergraphs (with B. Nagle and M. Schacht) Random Structures \& Algorithms, 2006, vol. 28, no. 22, pg. 113 - 179
  3. 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
  4. Applications of the regularity lemma for uniform hypergraphs (with J. Skokan) Random Structures \& Algorithms, 2006, vol. 28, no. 2, pg. 180 - 194
  5. A Dirac-type theorem for 3-uniform hypergraphs (with A. Ruciński and E. Szemerédi) Combin. Probab. Comput., 2006, vol. 15, no. 1 - 2, pg. 229 - 251
  6. 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
  7. Extremal hypergraph problems and the regularity method (with B. Nagle and M. Schacht) Topics in Discrete Mathematics, 2006, pg. 247 - 278
  8. Short paths in quasi-random 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
  9. Color critical hypergraphs with many edges (with M. H. Siggers) J. Graph Theory, 2006, vol. 53, no. 1, pg. 56 - 74
  10. A note on a conjecture by Füredi (with E. Tengan) J. Combin. Theory Ser. A, 2006, vol. 133, no. 6, pg. 1214 - 1218
  11. 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
  12. 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
  13. Density theorems and extremal hypergraph problems (with M. Schacht, E. Tengan and N. Tokushige) Israel J. Math., 2006, vol. 152, pg. 371 - 380
  14. Supersaturation for Ramsey-Turán problems (with D. Mubayi) Combinatorica, 2006, vol. 26, no. 3, pg. 315 - 332
  15. 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
  1. 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
  2. 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
  3. 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
  4. Distance graphs on the integers (with M. Ferrara and Y. Kohayakawa) Combin. Probab. Comput., 2005, vol. 14, no. 1 - 2, pg. 107 - 131
  5. Sharp bounds for some multicolor Ramsey numbers (with N. Alon) Combinatorica, 2005, vol. 25, no. 2, pg. 125 - 141
  6. Counting small cliques in 3-uniform hypergraphs (with Y. Peng and J. Skokan) Combin. Probab. Comput., 2005, vol. 14, no. 3, pg. 371 - 413
  7. On Cover Graphs and Dependent Arcs in Acyclic Orientations (with L. Thoma) Combin. Probab. Comput., 2005, vol. 14, no. 14, pg. 585 - 617
  8. Counting subgraphs in quasi-random 4-uniform hypergraphs (with J. Skokan) Random Structures \& Algorithms, 2005, vol. 26, no. 1 - 2, pg. 160 - 203
2004
  1. On graphs with small Ramsey numbers II (with A. V. Kostochka) Combinatorica, 2004, vol. 24, pg. 389 - 401
  2. Strong Ramsey properties of simplices (with P. Frankl) Israel J. Math., 2004, vol. 139, pg. 215 - 236
  3. Uniform edge distribution in hypergraphs is hereditary (with D. Mubayi) Electron. J. Combin., 2004, vol. 11, pp. 32
  4. 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
  5. 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
  6. Regularity lemma for uniform hypergraphs (with J. Skokan) Random Structures \& Algorithms, 2004, vol. 25, no. 1, pg. 1 - 42
  7. 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
  1. 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
  2. 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
  3. Ramsey games against a one-armed bandit (with E. Friedgut, Y. Kohayakawa, A. Ruciński and P. Tetali) Combin. Probab. Comput., 2003, vol. 12, no. 5 - 6, pg. 515 - 546
  4. 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
  5. Regular pairs in sparse random graphs (with Y. Kohayakawa) Random Structures \& Algorithms, 2003, vol. 22, no. 4, pg. 359 - 434
  6. On homogenous sets of positive integers J. Combin. Theory Ser. A, 2003, vol. 102, no. 1, pg. 229 - 240
  7. Hereditary properties of triple systems (with Y. Kohayakawa and B. Nagle) Combin. Probab. Comput., 2003, vol. 12, no. 2, pg. 155 - 189
  8. Szemerédi's regularity lemma and quasi-randomness (with Y. Kohayakawa) CMS Books in Mathematics: Recent advances in algorithms and combinatorics, 2003, pg. 289 - 351
  9. Integer and fractional packings in dense 3-uniform hypergraphs (with P. Haxell and B. Nagle) Random Structures \& Algorithms, 2003, vol. 22, no. 3, pg. 248 - 310
  10. Regularity properties for triple systems (with B. Nagle) Random Structures \& Algorithms, 2003, vol. 23, no. 3, pg. 264 - 332
  11. An Optimal Algorithm for Checking Regularity (with Y. Kohayakawa and L. Thoma) SIAM J. Comput., 2003, vol. 32, no. 5, pg. 1210 - 1235
2002
  1. 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
  2. An optimal algorithm for checking regularity (extended abstract) (with Y. Kohayakawa and L. Thoma) Thirteenth ACM-SIAM Symposium on Discrete Algorithms, SODA (2002, San Francisco, CA), 2002, pg. 277 - 286
  3. On characterizing hypergraph regularity (with Y. Dementieva, P. Haxell and B. Nagle) Random Structures \& Algorithms, 2002, vol. 21, no. 2 - 3, pg. 293 - 335
  4. 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
  5. On the Turán number of triple systems (with D. Mubayi) J. Combin. Theory Ser. A, 2002, vol. 100, no. 1, pg. 136 - 152
  6. Extremal problems on set systems (with P. Frankl) Random Structures \& Algorithms, 2002, vol. 20, no. 2, pg. 131 - 164
  7. Hypergraphs, quasi-randomness, and conditions for regularity (with Y. Kohayakawa and J. Skokan) J. Combin. Theory Ser. A, 2002, vol. 97, no. 2, pg. 307 - 352
  8. Holes in graphs (with Y. Peng and A. Ruciński) Electron. J. Combin., 2002, vol. 9, pg. 1 - 18
2001
  1. Proof of a hypercontractive estimate via entropy (with E. Friedgut) Israel J. Math., 2001, vol. 125, pg. 369 - 380
  2. On bipartite graphs with linear Ramsey numbers (with R. L. Graham and A. Ruciński) Combinatorica, 2001, vol. 21, no. 2, pg. 199 - 209
  3. Integer and fractional packings in dense graphs (with P. Haxell) Combinatorica, 2001, vol. 21, no. 1, pg. 13 - 38
  4. Near-optimum 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
  5. On graphs with small Ramsey numbers (with A. V. Kostochka) J. Graph Theory, 2001, vol. 37, no. 4, pg. 198 - 204
  6. Matchings meeting quotas and their impact on the blow-up lemma (with A. Ruciński and M. Wagner) SIAM J. Comput., 2001, vol. 31, no. 2, pg. 428 - 446
  7. 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
  8. 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
  9. Independent arithmetic progressions in clique-free 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
  1. 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
  2. On size Ramsey numbers of graphs with bounded degree (with E. Szemerédi) Combinatorica, 2000, vol. 20, no. 2, pg. 257 - 262
  3. 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
  4. 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
  5. An algorithmic regularity lemma for hypergraphs (with A. Czygrinow) SIAM J. Comput., 2000, vol. 30, no. 4, pg. 1041 - 1066
  6. 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
  1. Hypergraph packing and graph embedding (with A. Ruciński and A. Taraz) Combin. Probab. Comput., 1999, vol. 8, no. 4, pg. 363 - 376
  2. 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
  3. Perfect matchings in ε-regular graphs and the blow-up lemma (with A. Ruciński) Combinatorica, 1999, vol. 19, no. 3, pg. 437 - 452
  4. Non-Ramsey graphs are c log(n)-universal (with H. J. Prömel) J. Combin. Theory Ser. A, 1999, vol. 88, no. 2, pg. 379 - 384
  5. 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
  6. Constructive quasi-Ramsey numbers and tournament ranking (with A. Czygrinow and S. Poljak) SIAM J. Discrete Math., 1999, vol. 12, no. 1, pg. 48 - 63
1998
  1. Partitioning two-coloured complete graphs into two monochromatic cycles (with T. Łuczak and E. Szemerédi) Combin. Probab. Comput., 1998, vol. 7, no. 4, pg. 423 - 436
  2. Partial Steiner systems and matchings in hypergraphs (with A. V. Kostochka) Random Structures \& Algorithms, 1998, vol. 13, no. 3 - 4, pg. 335 - 347
  3. Induced Ramsey numbers (with Y. Kohayakawa and H. J. Prömel) Combinatorica, 1998, vol. 18, no. 3, pg. 373 - 404
  4. On large systems of sets with no large weak Δ-subsystems (with A. V. Kostochka) Combinatorica, 1998, vol. 18, no. 2, pg. 235 - 240
  5. 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
  6. Biased positional games on hypergraphs (with D. Duffus and T. Łuczak) Studia Sci. Math. Hungar., 1998, vol. 34, no. 1 - 3, pg. 141 - 149
  7. Perfect matchings in ε-regular graphs (with N. Alon and A. Ruciński) Electron. J. Combin., 1998, vol. 5, no. 1, pg. 4 - 7
  8. Extremal problems for affine cubes of integers (with D. S. Gunderson) Combin. Probab. Comput., 1998, vol. 7, no. 1, pg. 65 - 79
  9. 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
  10. Ramsey properties of random hypergraphs (with A. Ruciński) J. Combin. Theory Ser. A, 1998, vol. 81, no. 1, pg. 1 - 33
  11. 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
  1. Arrangeability and clique subdivisions (with R. Thomas) The mathematics of Paul Erdős II, Algorithms Combin. 14, 1997, pg. 236 - 239
  2. 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
  3. Bipartite coverings of graphs (with A. Ruciński) Combin. Probab. Comput., 1997, vol. 6, no. 3, pg. 349 - 352
  4. Rado partition theorem for random subsets of integers (with A. Ruciński) Proc. London Math. Soc., 1997, vol. 74, no. 3, pg. 481 - 502
  5. Note on regular subgraphs (with B. Wysocka) J. Graph Theory, 1997, vol. 24, no. 2, pg. 139 - 154
  6. On K4-free subgraphs of random graphs (with Y. Kohayakawa and T. Łuczak) Combinatorica, 1997, vol. 17, no. 2, pg. 173 - 213
  7. Chromatic Ramsey theory (with N. Sauer and R. Woodrow) European J. Combin., 1997, vol. 18, no. 1, pg. 93 - 102
  8. 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
  1. 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
  2. Graphs of small dimensions (with N. Eaton) Combinatorica, 1996, vol. 16, no. 1, pg. 59 - 85
  3. On p-intersection representations (with N. Eaton and R. J. Gould) J. Graph Theory, 1996, vol. 21, no. 4, pg. 377 - 392
  4. Asymptotic packing and the random greedy algorithm (with L. Thoma) Random Structures \& Algorithms, 1996, vol. 8, no. 3, pg. 161 - 177
  5. Extremal problems for linear orders on [n]^p (with R. Švarc and B. Wysocka) Order, 1996, vol. 13, no. 2, pg. 119 - 134
  6. 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
  7. 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
  8. Multicolored subsets in colored hypergraphs (with H. Lefmann and B. Wysocka) J. Combin. Theory Ser. A, 1996, vol. 74, no. 2, pg. 209 - 248
  9. 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
  10. Ramsey-type results for oriented trees (with Y. Kohayakawa and T. Łuczak) J. Graph Theory, 1996, vol. 22, no. 1, pg. 1 - 8
  11. A remark on Pisier type theorems (with P. Erdős and J. Nešetřil) Congr. Numer., 1996, vol. 113, pg. 101 - 109
  12. Proper bounded edge-colorings (extended abstract) (with C. Bertram-Kretzberg, 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
  1. Threshold functions for Ramsey properties (with A. Ruciński) J. Amer. Math. Soc, 1995, vol. 8, no. 4, pg. 917 - 942
  2. Ramsey families which exclude a graph (with N. Sauer and X. Zhu) Combinatorica, 1995, vol. 15, no. 4, pg. 589 - 596
  3. Note on Ramsey numbers and self-complementary graphs (with E. Šiňajová) Math. Slovaca, 1995, vol. 45, no. 3, pg. 243 - 249
  4. 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
  5. 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
  6. Coverings of r-graphs by complete r-partite subgraphs (with P. Erdős) Random Structures \& Algorithms, 1995, vol. 6, no. 2 - 3, pg. 319 - 322
  7. On uncrowded hypergraphs (with R. Duke and H. Lefmann) Random Structures \& Algorithms, 1995, vol. 6, no. 2 - 3, pg. 209 - 212
  8. More on the complexity of cover graphs (with J. Nešetřil) Comment. Math. Univ. Carolin., 1995, vol. 36, no. 2, pg. 269 - 278
  9. On the jumping constant conjecture for multigraphs (with A. Sidorenko) J. Combin. Theory Ser. A, 1995, vol. 69, no. 2, pg. 347 - 357
  10. The minimum independence number for designs (with D. A. Grable and K. T. Phelps) Combinatorica, 1995, vol. 15, no. 2, pg. 175 - 185
  11. 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
  12. On the genus of a random graph (with R. Thomas) Random Structures \& Algorithms, 1995, vol. 6, no. 1, pg. 1 - 12
  13. Dense graphs without 3-regular subgraphs (with L. Pyber and E. Szemerédi) J. Combin. Theory Ser. B, 1995, vol. 63, no. 1, pg. 41 - 54
  14. On Ramsey sets in spheres (with J. Matoušek) J. Combin. Theory Ser. A, 1995, vol. 70, no. 1, pg. 30 - 44
  15. On Erdős-Rado numbers (with H. Lefmann) Combinatorica, 1995, vol. 15, no. 1, pg. 85 - 104
  16. 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
  1. Note on independent sets in Steiner systems (with E. Šiňajová) Random Structures \& Algorithms, 1994, vol. 5, no. 1, pg. 183 - 190
  2. Random graphs with monochromatic triangles in every edge coloring (with A. Ruciński) Random Structures \& Algorithms, 1994, vol. 5, no. 2, pg. 253 - 270
  3. The Erdős-Ko-Rado theorem for small families (with R. Duke) J. Combin. Theory Ser. A, 1994, vol. 65, no. 2, pg. 246 - 251
  4. Unbalanced Steiner triple systems (with L. Haddad) J. Combin. Theory Ser. A, 1994, vol. 66, no. 1, pg. 1 - 16
  5. 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
  6. Some combinatorial-algebraic problems from complexity theory (with P. Pudlák) Discrete Math., 1994, vol. 136, no. 1 - 3, pg. 253 - 279
1993
  1. 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
  2. Folkman numbers for graphs of small order (with J. I. Brown) Ars Combin., 1993, vol. 35, pg. 11 - 27
  3. Corrigendum: "Complexity of diagrams" (with J. Nešetřil) Order, 1993, vol. 10, pp. 393
  4. Monochromatic trees with respect to edge partitions (with B. Voigt) J. Combin. Theory Ser. B, 1993, vol. 58, no. 2, pg. 291 - 298
  5. 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
  6. On isomorphic subgraphs (with R. J. Gould) Discrete Math., 1993, vol. 118, no. 1 - 3, pg. 259 - 262
  7. 2-colorings of complete graphs with a small number of monochromatic K4 subgraphs (with F. Franěk) Discrete Math. 114 (1993), no. 1-3, 199-203, Combinatorics and algorithms (Jerusalem, 1988)., 1993, pg. 199 - 203
  8. Extremal problems for triple systems (with H. Lefmann and K. T. Phelps) J. Combin. Designs, 1993, vol. 1, no. 5, pg. 379 - 394
  9. 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
  10. Rigid linear binary codes (with H. Lefmann and K. T. Phelps) J. Combin. Theory Ser. A, 1993, vol. 63, no. 1, pg. 110 - 128
  11. Lower bounds on probability thresholds for Ramsey properties (with A. Ruciński) Combinatorics, Paul Erdős is eighty, Vol. 1, 1993, pg. 317 - 346
  12. On canonical Ramsey numbers for coloring three-element sets (with H. Lefmann) Finite and infinite combinatorics in sets and logic (1991, Banff, Alberta), Kluwer Acad. Publ., Dordrecht, 1993, pg. 237 - 247
1992
  1. 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
  2. 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
  3. On the complexity of coloring areflexive relations (with L. Haddad) Ars Combin., 1992, vol. 33, pg. 217 - 225
  4. 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
  5. Monochromatic vs multicolored paths (with H. Lefmann and R. Thomas) Graphs Combin., 1992, vol. 8, no. 4, pg. 323 - 332
  6. The uniformity lemma for hypergraphs (with P. Frankl) Graphs Combin., 1992, vol. 8, no. 4, pg. 309 - 312
  7. 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
  8. A canonical Ramsey theorem (with N. Eaton) Random Structures \& Algorithms, 1992, vol. 3, no. 4, pg. 427 - 444
  9. Rainbow subgraphs in properly edge-colored graphs (with Z. Tuza) Random Structures \& Algorithms, 1992, vol. 3, no. 2, pg. 175 - 182
  10. A combinatorial approach to complexity (with P. Pudlák) Combinatorica, 1992, vol. 12, no. 2, pg. 221 - 226
  11. Cycle-connected graphs (with R. Duke and P. Erdős) Discrete Math., 1992, vol. 108, no. 1 - 3, pg. 261 - 278
  12. On coverings of infinite-dimensional metric spaces (with J. Pelant) Discrete Math., 1992, vol. 108, no. 1 - 3, pg. 75 - 81
  13. On Ramsey graphs without bipartite subgraphs (with J. Nešetřil) Discrete Math., 1992, vol. 101, no. 1 - 3, pg. 223 - 229
  14. 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
  15. Enumeration of order preserving maps (with D. Duffus, B. Sands and R. Woodrow) Order, 1992, vol. 9, no. 1, pg. 15 - 29
  16. 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
  17. 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, North-Holland, Amsterdam, 1992, pg. 297 - 313
  18. On an anti-Ramsey type result (with N. Alon and H. Lefmann) Sets, graphs and numbers (1991, Budapest), Colloq. Math. Soc. János Bolyai, 60, North-Holland, Amsterdam, 1992, pg. 9 - 22
1991
  1. The number of t-wise 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
  2. A Ramsey type problem concerning vertex colourings (with J. I. Brown) J. Combin. Theory Ser. B, 1991, vol. 52, no. 1, pg. 45 - 52
  3. Extremal problems for cycle-connected graphs (with R. Duke and P. Erdős) Twenty-second Southeastern Conference on Combinatorics, Graph Theory, and Computing (1991, Baton Rouge, LA), 1991, pg. 147 - 151
  4. Monochromatic solutions to equations with unit fractions (with T. C. Brown) Bull. Austral. Math. Soc., 1991, vol. 43, no. 3, pg. 387 - 392
  5. 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
  1. A partition property of simplices in Euclidean space (with P. Frankl) J. Amer. Math. Soc, 1990, vol. 3, no. 1, pg. 1 - 7
  2. Some developments in Ramsey theory International Congress of Mathematicians, ICM (1990, Kyoto), 1990, pg. 1455 - 1466
  3. 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
  4. 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
  5. Partite construction and Ramsey space systems (with J. Nešetřil) Algorithms and Combinatorics: Mathematics of Ramsey theory, 1990, pg. 98 - 112
  6. Some results in finite graph Ramsey theory (with D. S. Gunderson and N. Sauer) Twenty-first Southeastern Conference on Combinatorics, Graph Theory and Computing (1990, Boca Raton, FL), 1990, pg. 232 - 243
  7. A new construction of k-Folkman graphs (with J. I. Brown) Ars Combin., 1990, vol. 29, pg. 265 - 269
  8. 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
  9. 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
  10. On Ramsey families of sets Graphs Combin., 1990, vol. 6, no. 2, pg. 187 - 195
  11. 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
  1. Embeddings of graphs in Euclidean spaces (with J. Reiterman and E. Šiňajová) Discrete Comput. Geom., 1989, vol. 4, no. 4, pg. 349 - 364
  2. A Ramsey-type theorem for orderings of a graph (with P. M. Winkler) SIAM J. Discrete Math., 1989, vol. 2, no. 3, pg. 402 - 406
  3. Geometrical embeddings of graphs (with J. Reiterman and E. Šiňajová) Discrete Math., 1989, vol. 74, no. 3, pg. 291 - 319
  4. Chromatically optimal rigid graphs (with J. Nešetřil) J. Combin. Theory Ser. B, 1989, vol. 46, no. 2, pg. 133 - 141
  5. The partite construction and Ramsey set systems (with J. Nešetřil) Discrete Math., 1989, vol. 75, no. 1 - 3, pg. 327 - 334
  6. Percentages in pairwise balanced designs (with C. J. Colbourn) Discrete Math., 1989, vol. 77, no. 1 - 3, pg. 57 - 63
  7. 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
  1. Graph complexity (with P. Pudlák and P. Savický) Acta Inform., 1988, vol. 25, no. 5, pg. 515 - 535
  2. Some Ramsey-Turán type results for hypergraphs (with P. Frankl) Combinatorica, 1988, vol. 8, no. 4, pg. 323 - 332
  3. 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
  4. 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
  5. 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
  6. 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
  7. 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
  8. 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
  1. Small spaces with large point character European J. Combin., 1987, vol. 8, no. 1, pg. 55 - 58
  2. Strong Ramsey theorems for Steiner systems (with J. Nešetřil) Trans. Amer. Math. Soc., 1987, vol. 303, no. 1, pg. 183 - 192
  3. Forbidden intersections (with P. Frankl) Trans. Amer. Math. Soc., 1987, vol. 300, no. 1, pg. 259 - 286
  4. Complexity of diagrams (with J. Nešetřil) Order, 1987, vol. 3, no. 4, pg. 321 - 330
  5. 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
  6. A note on ranking functions (with W. T. Trotter) Discrete Math., 1987, vol. 67, no. 3, pg. 307 - 309
  7. Multiple optima in local search (with C. Tovey) J. Algorithms, 1987, vol. 8, no. 2, pg. 250 - 259
  8. Local k-colorings 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
  9. Large trees in random graphs (with L. Kučera) Comment. Math. Univ. Carolin., 1987, vol. 28, no. 1, pg. 7 - 14
  10. On subsets of abelian groups with no 3-term arithmetic progression (with P. Frankl and R. L. Graham) J. Combin. Theory Ser. A, 1987, vol. 45, no. 1, pg. 157 - 161
  11. 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
  12. 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
  1. 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
  2. All triangles are Ramsey (with P. Frankl) Trans. Amer. Math. Soc., 1986, vol. 297, no. 2, pg. 777 - 779
  3. Steiner triple systems with minimum independence number (with K. T. Phelps) Ars Combin., 1986, vol. 21, pg. 167 - 172
  4. Finite union theorem with restrictions (with J. Nešetřil) Graphs Combin., 1986, vol. 2, no. 4, pg. 357 - 361
  5. On sets of integers with the Schur property (with J. Nešetřil) Graphs Combin., 1986, vol. 2, no. 3, pg. 269 - 275
  6. On hereditarily rigid algebras (with V. Koubek) Algebra Universalis, 1986, vol. 22, no. 2 - 3, pg. 120 - 141
  7. Large triangle-free subgraphs in graphs without K4 (with P. Frankl) Graphs Combin., 1986, vol. 2, no. 2, pg. 135 - 144
  8. 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
  9. On universality of graphs with uniformly distributed edges Discrete Math., 1986, vol. 59, no. 1 - 2, pg. 125 - 134
  10. 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
  11. Coloring of universal graphs (with P. Komjáth) Graphs Combin., 1986, vol. 2, no. 1, pg. 55 - 60
  12. An elementary proof of the canonizing version of Gallai-Witt's theorem (with H. J. Prömel) J. Combin. Theory Ser. A, 1986, vol. 42, no. 1, pg. 144 - 149
  13. 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
  1. 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
  2. Two proofs in combinatorial number theory (with J. Nešetřil) Proc. Amer. Math. Soc., 1985, vol. 93, no. 1, pg. 185 - 188
  3. Near perfect coverings in graphs and hypergraphs (with P. Frankl) European J. Combin., 1985, vol. 6, no. 4, pg. 317 - 326
  4. Two remarks on Ramsey's theorem (with J. Nešetřil) Discrete Math., 1985, vol. 54, no. 3, pg. 339 - 341
  5. Note on a Ramsey-Turán type problem Graphs Combin., 1985, vol. 1, no. 3, pg. 291 - 293
  6. Lower bounds for Turán's problem (with P. Frankl) Graphs Combin., 1985, vol. 1, no. 3, pg. 213 - 216
  7. On color critical graphs (with Z. Tuza) J. Combin. Theory Ser. B, 1985, vol. 38, no. 3, pg. 204 - 213
  8. Note on the number of monoids of order n (with V. Koubek) Comment. Math. Univ. Carolin., 1985, vol. 26, no. 2, pg. 309 - 314
  9. Threshold hypergraphs (with J. Reiterman, E. Šiňajová and M. Tůma) Discrete Math., 1985, vol. 54, no. 2, pg. 193 - 200
  10. Canonizing ordering theorems for Hales-Jewett 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
  11. 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
  12. On graphs with small subgraphs of large chromatic number (with R. Duke) Graphs Combin., 1985, vol. 1, no. 1, pg. 91 - 96
  13. On a packing and covering problem European J. Combin., 1985, vol. 6, no. 1, pg. 69 - 78
  14. Three remarks on dimensions of graphs (with J. Nešetřil) 1st Poznan Seminar on Random Graphs (1983, Poznań), North-Holland, Amsterdam, 1985, pg. 199 - 207
1984
  1. 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
  2. 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
  3. 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
  4. Steiner triple systems with small maximal independent sets (with M. D. Brandes) Ars Combin., 1984, vol. 17, pg. 15 - 19
  5. On combinatorial properties of spheres in Euclidean spaces Combinatorica, 1984, vol. 4, no. 4, pg. 345 - 349
  6. 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
  7. Hypergraphs do not jump (with P. Frankl) Combinatorica, 1984, vol. 4, no. 2 - 3, pg. 149 - 159
  8. How to build a barricade (with P. Frankl and J. Pach) Monatsh. Math., 1984, vol. 98, no. 2, pg. 93 - 98
  9. 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
  10. Combinatorial partitions of finite posets and lattices-Ramsey lattices (with J. Nešetřil) Algebra Universalis, 1984, vol. 19, no. 1, pg. 106 - 119
  11. Sparse Ramsey graphs (with J. Nešetřil) Combinatorica, 1984, vol. 4, no. 1, pg. 71 - 78
  12. Selectivity of hypergraphs (with P. Erdős and J. Nešetřil) Finite and infinite sets (1981, Eger), North-Holland, Amsterdam, 1984, pg. 265 - 284
1983
  1. Ramsey classes of set systems (with J. Nešetřil) J. Combin. Theory Ser. A, 1983, vol. 34, no. 2, pg. 183 - 201
  2. On the achromatic number of simple hypergraphs (with J. Nešetřil and K. T. Phelps) Ars Combin., 1983, vol. 16, pg. 95 - 102
  3. On a product dimension of bipartite graphs (with S. Poljak and A. Pultr) J. Graph Theory, 1983, vol. 7, no. 4, pg. 475 - 486
  4. 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
  5. On qualitatively independent partitions and related problems (with S. Poljak and A. Pultr) Discrete Appl. Math., 1983, vol. 6, no. 2, pg. 193 - 205
  6. On classes of graphs determined by forbidden subgraphs (with S. Poljak) Czechoslovak Math. J., 1983, vol. 33(108), no. 1, pg. 27 - 33
  7. On a problem in combinatorial geometry Discrete Math., 1983, vol. 45, no. 1, pg. 129 - 131
  8. Another proof of the Folkman-Rado-Sanders theorem (with J. Nešetřil) J. Combin. Theory Ser. A, 1983, vol. 34, no. 1, pg. 108 - 109
  9. 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
  10. 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
  11. 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
  12. Products of graphs and their applications (with J. Nešetřil) Graph theory (1981, Łagów), Springer, Berlin, 1983, pg. 151 - 160
1982
  1. 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
  2. Note on packing, covering and Turán numbers 10th Winter School on Abstract Analysis (1982, Srní), 1982, pg. 263 - 265
  3. 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
  4. 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
  5. Nearly bipartite graphs with large chromatic number Combinatorica, 1982, vol. 2, no. 4, pg. 377 - 383
  6. Coloring block designs is NP-complete (with C. J. Colbourn, M. J. Colbourn and K. T. Phelps) SIAM J. Algebraic Discrete Methods, 1982, vol. 3, no. 3, pg. 305 - 307
  7. 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
  8. Monotone paths in ordered graphs (with V. Müller) Combinatorica, 1982, vol. 2, no. 2, pg. 193 - 201
  9. A note on finite Boolean algebras Acta Polytech. ČVUT Praha, 1982, vol. 1982, no. 1, pg. 47 - 50
  10. 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
  11. 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
  12. Partition theorems for systems of finite subsets of integers (with P. Pudlák) Discrete Math., 1982, vol. 39, no. 1, pg. 67 - 73
1981
  1. A note on universal graphs Ars Combin., 1981, vol. 11, pg. 225 - 229
  2. On number of covering arcs in orderings (with V. Koubek) Comment. Math. Univ. Carolin., 1981, vol. 22, no. 4, pg. 721 - 733
  3. 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
  4. On set systems determined by intersections (with S. Poljak) Discrete Math., 1981, vol. 34, no. 2, pg. 173 - 184
  5. On the arc-chromatic number of a digraph (with S. Poljak) J. Combin. Theory Ser. B, 1981, vol. 31, no. 2, pg. 190 - 198
  6. 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
  7. 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
  8. On the dimension of Kneser graphs (with S. Poljak and A. Pultr) Algebraic methods in graph theory (1978, Szeged), North-Holland, Amsterdam, 1981, pg. 631 - 646
1980
  1. Atoms in uniformities (with J. Reiterman) Pokroky Mat. Fyz. Astronom., 1980, vol. 25, no. 4, pg. 208 - 217
  2. Orthogonal partitions and covering of graphs (with S. Poljak) Czechoslovak Math. J., 1980, vol. 30(105), no. 3, pg. 475 - 485
1979
  1. On non-zero dimensional atoms (with J. Reiterman) 7th Winter School on Abstract Analysis (1976, Prague), 1979, pg. 67 - 78
  2. 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
  3. 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
  4. 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
  5. 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
  1. 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
  2. Selective graphs and hypergraphs (with J. Nešetřil) Ann. Discrete Math., 1978, vol. 3, pg. 181 - 189
  3. On a probabilistic graph-theoretical method (with J. Nešetřil) Proc. Amer. Math. Soc., 1978, vol. 72, no. 2, pg. 417 - 421
  4. On systems of graphs intersecting in paths Comment. Math. Univ. Carolin., 1978, vol. 19, no. 1, pg. 135 - 140
  5. A simple proof of the Galvin-Ramsey 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
  6. Partition (Ramsey) theory - a survey (with J. Nešetřil) Fifth Hungarian Colloquium on Combinatorics (1976, Keszthely), North-Holland, Amsterdam, 1978, pg. 759 - 792
  7. 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
  8. 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
  1. On the chromatic number of subgraphs of a given graph Proc. Amer. Math. Soc., 1977, vol. 64, no. 2, pg. 370 - 371
  2. A structural generalization of the Ramsey theorem (with J. Nešetřil) Bull. Amer. Math. Soc., 1977, vol. 83, no. 1, pg. 127 - 128
  3. 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
  4. On critical 3-chromatic hypergraphs (with V. Müller and D. Turzík) Acta Math. Acad. Sci. Hungar., 1977, vol. 29, no. 3 - 4, pg. 273 - 281
  5. 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
  6. 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
  7. Canonical partition relations and point character of l1 spaces Seminar on Uniform Spaces (Prague, 1976-77), 1977, pg. 79 - 81
  8. A non-zero dimensional atom (with J. Reiterman) Seminar on Uniform Spaces (Prague, 1976-77), 1977, pg. 65 - 74
1976
  1. A generalization of the Ramsey theorem Graphs, Hypergraphs, and Block Systems (1976, Zielona Gora), 1976, pg. 211 - 219
  2. 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
  3. 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
  4. 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
  5. 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
  6. Partitions of vertices (with J. Nešetřil) Comment. Math. Univ. Carolin., 1976, vol. 17, no. 1, pg. 85 - 95
1975
  1. Partitions of subgraphs (with J. Nešetřil) Recent advances in graph theory (1975, Prague), Academia, 1975, pg. 413 - 423
  2. Fineness in the category of all 0-dimensional uniform spaces Seminar on Uniform Spaces (Prague, 1973-74), 1975, pg. 139 - 143
  3. 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, North-Holland, Amsterdam, 1975, pg. 1127 - 1132
1974
  1. 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
  2. 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
  1. On generating of relations (with J. Pelant) Comment. Math. Univ. Carolin., 1973, vol. 14, pg. 95 - 105