% csauthors.net - beta - BibTeX bibliography of Vojtech Rödl
@article{journals/jct/Nesetril77,
title = {Partitions of Finite Relational and Set Systems.},
year = {1977},
journal = {J. Comb. Theory, Ser. A},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/dm/NesetrilR78,
title = {A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph.},
year = {1978},
journal = {Discrete Mathematics},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/jct/NesetrilR79,
title = {A short proof of the existence of highly chromatic hypergraphs without short cycles.},
year = {1979},
journal = {J. Comb. Theory, Ser. B},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@inproceedings{conf/fct/GoralcikGKR81,
title = {Fast Recognition of Rings and Lattices.},
year = {1981},
booktitle = {FCT},
author = {{Pavel Goralcik} and {A. Goralciková} and {Václav Koubek} and {Vojtech Rödl}},
publisher = {Springer},
booktitle = {Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981}
}
@article{journals/combinatorica/NesetrilR81,
title = {Simple proof of the existence of restricted Ramsey graphs by means of a partite construction.},
year = {1981},
journal = {Combinatorica},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/dam/PoljakRT81,
title = {Complexity of representation of graphs by set systems.},
year = {1981},
journal = {Discrete Applied Mathematics},
author = {{Svatopluk Poljak} and {Vojtech Rödl} and {Daniel Turzík}}
}
@article{journals/dm/PoljakR81,
title = {On set systems determined by intersections.},
year = {1981},
journal = {Discrete Mathematics},
author = {{Svatopluk Poljak} and {Vojtech Rödl}}
}
@article{journals/combinatorica/MullerR82,
title = {Monotone paths in ordered graphs.},
year = {1982},
journal = {Combinatorica},
author = {{Vladimír Müller} and {Vojtech Rödl}}
}
@article{journals/combinatorica/Rodl82,
title = {Nearly bipartite graphs with large chromatic number.},
year = {1982},
journal = {Combinatorica},
author = {{Vojtech Rödl}}
}
@article{journals/dam/ColbournCPR82,
title = {Colouring steiner quadruple systems.},
year = {1982},
journal = {Discrete Applied Mathematics},
author = {{Charles J. Colbourn} and {Marlene J. Colbourn} and {Kevin T. Phelps} and {Vojtech Rödl}}
}
@article{journals/dm/PudlakR82,
title = {Partition theorems for systems of finite subsets of integers.},
year = {1982},
journal = {Discrete Mathematics},
author = {{Pavel Pudlák} and {Vojtech Rödl}}
}
@article{journals/ejc/NesetrilR82,
title = {Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs.},
year = {1982},
journal = {Eur. J. Comb.},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/dam/PoljakPR83,
title = {On qualitatively independent partitions and related problems.},
year = {1983},
journal = {Discrete Applied Mathematics},
author = {{Svatopluk Poljak} and {Ales Pultr} and {Vojtech Rödl}}
}
@article{journals/dm/Rodl83,
title = {On a problem in combinatorial geometry.},
year = {1983},
journal = {Discrete Mathematics},
author = {{Vojtech Rödl}}
}
@article{journals/jct/ChvatalRST83,
title = {The Ramsey number of a graph with bounded maximum degree.},
year = {1983},
journal = {J. Comb. Theory, Ser. B},
author = {{C. Chvatál} and {Vojtech Rödl} and {Endre Szemerédi} and {William T. Trotter}}
}
@article{journals/jct/NesetrilR83,
title = {Another Proof of the Folkman-Rado-Sanders Theorem.},
year = {1983},
journal = {J. Comb. Theory, Ser. A},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/jct/NesetrilR83a,
title = {Ramsey Classes of Set Systems.},
year = {1983},
journal = {J. Comb. Theory, Ser. A},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/jgt/PoljakRP83,
title = {On a product dimension of bipartite graphs.},
year = {1983},
journal = {Journal of Graph Theory},
author = {{Svatopluk Poljak} and {Vojtech Rödl} and {Ales Pultr}}
}
@article{journals/combinatorica/Frankl84,
title = {Hypergraphs do not jump.},
year = {1984},
journal = {Combinatorica},
author = {{Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/combinatorica/NesetrilR84,
title = {Sparse Ramsey graphs.},
year = {1984},
journal = {Combinatorica},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/combinatorica/PhelpsR84,
title = {On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems.},
year = {1984},
journal = {Combinatorica},
author = {{Kevin T. Phelps} and {Vojtech Rödl}}
}
@article{journals/combinatorica/Rodl84,
title = {On combinatorial properties of spheres in eulidean spaces.},
year = {1984},
journal = {Combinatorica},
author = {{Vojtech Rödl}}
}
@article{journals/jct/KoubekR84,
title = {On the minimum order of graphs with given semigroup.},
year = {1984},
journal = {J. Comb. Theory, Ser. B},
author = {{Václav Koubek} and {Vojtech Rödl}}
}
@inproceedings{conf/focs/AlonFR85,
title = {Geometrical Realization of Set Systems and Probabilistic Communication Complexity},
year = {1985},
booktitle = {FOCS},
author = {{Noga Alon} and {Peter Frankl} and {Vojtech Rödl}},
publisher = {IEEE Computer Society},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21-23 October 1985}
}
@article{journals/dm/BurrNR85,
title = {On the use of senders in generalized ramsey theory for graphs.},
year = {1985},
journal = {Discrete Mathematics},
author = {{Stefan A. Burr} and {Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/dm/NesetrilR85,
title = {Two remarks on Ramsey's theorem.},
year = {1985},
journal = {Discrete Mathematics},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/dm/ReitermanRST85,
title = {Threshold hypergraphs.},
year = {1985},
journal = {Discrete Mathematics},
author = {{Jan Reiterman} and {Vojtech Rödl} and {Edita Sinajová} and {Miroslav Tuma}}
}
@article{journals/ejc/FranklR85,
title = {Near Perfect Coverings in Graphs and Hypergraphs.},
year = {1985},
journal = {Eur. J. Comb.},
author = {{Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/ejc/Rodl85,
title = {On a Packing and Covering Problem.},
year = {1985},
journal = {Eur. J. Comb.},
author = {{Vojtech Rödl}}
}
@article{journals/gc/FranklR85,
title = {Lower bounds for Turán's problem.},
year = {1985},
journal = {Graphs and Combinatorics},
author = {{Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/gc/Rodl85,
title = {Note on a Ramsey-Turán type problem.},
year = {1985},
journal = {Graphs and Combinatorics},
author = {{Vojtech Rödl}}
}
@article{journals/gc/RodlD85,
title = {On graphs with small subgraphs of large chromatic number.},
year = {1985},
journal = {Graphs and Combinatorics},
author = {{Vojtech Rödl} and {Richard A. Duke}}
}
@article{journals/jct/NesetrilPRV85,
title = {Canonizing Ordering Theorems for Hales Jewett Structures.},
year = {1985},
journal = {J. Comb. Theory, Ser. A},
author = {{Jaroslav Nesetril} and {Hans Jürgen Prömel} and {Vojtech Rödl} and {Bernd Voigt}}
}
@article{journals/jct/RodlT85,
title = {On color critical graphs.},
year = {1985},
journal = {J. Comb. Theory, Ser. B},
author = {{Vojtech Rödl} and {Zsolt Tuza}}
}
@inproceedings{conf/stoc/AjtaiBHKPRST86,
title = {Two lower bounds for branching programs},
year = {1986},
booktitle = {STOC},
author = {{Miklós Ajtai} and {László Babai} and {Péter Hajnal} and {János Komlós} and {Pavel Pudlák} and {Vojtech Rödl} and {Endre Szemerédi} and {György Turán}},
publisher = {ACM},
booktitle = {Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, USA}
}
@article{journals/dm/ErdosFHKRS86,
title = {Coloring graphs with locally few colors.},
year = {1986},
journal = {Discrete Mathematics},
author = {{Paul Erdös} and {Zoltán Füredi} and {András Hajnal} and {Péter Komjáth} and {Vojtech Rödl} and {Ákos Seress}}
}
@article{journals/dm/Rodl86,
title = {On universality of graphs with uniformly distributed edges.},
year = {1986},
journal = {Discrete Mathematics},
author = {{Vojtech Rödl}}
}
@article{journals/gc/ErdosFR86,
title = {The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent.},
year = {1986},
journal = {Graphs and Combinatorics},
author = {{Paul Erdös} and {Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/gc/FranklR86,
title = {Large triangle-free subgraphs in graphs without*K*_{4}.},
year = {1986},
journal = {Graphs and Combinatorics},
author = {{Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/gc/KomjathR86,
title = {Coloring of universal graphs.},
year = {1986},
journal = {Graphs and Combinatorics},
author = {{Péter Komjáth} and {Vojtech Rödl}}
}
@article{journals/gc/NesetrilR86,
title = {On sets of integers with the Schur property.},
year = {1986},
journal = {Graphs and Combinatorics},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/gc/NesetrilR86a,
title = {Finite union theorem with restrictions.},
year = {1986},
journal = {Graphs and Combinatorics},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/jct/PreissR86,
title = {Note on decomposition of spheres in Hilbert spaces.},
year = {1986},
journal = {J. Comb. Theory, Ser. A},
author = {{David Preiss} and {Vojtech Rödl}}
}
@article{journals/jct/PromelR86,
title = {An elementary proof of the canonizing version of Gallai-Witt's theorem.},
year = {1986},
journal = {J. Comb. Theory, Ser. A},
author = {{Hans Jürgen Prömel} and {Vojtech Rödl}}
}
@article{journals/dm/RodlT87,
title = {A note on ranking functions.},
year = {1987},
journal = {Discrete Mathematics},
author = {{Vojtech Rödl} and {William T. Trotter}}
}
@article{journals/ejc/Rodl87,
title = {Small Spaces with Large Point Character.},
year = {1987},
journal = {Eur. J. Comb.},
author = {{Vojtech Rödl}}
}
@article{journals/jal/RodlT87,
title = {Multiple Optima in Local Search.},
year = {1987},
journal = {J. Algorithms},
author = {{Vojtech Rödl} and {Craig A. Tovey}}
}
@article{journals/jct/FranklGR87,
title = {On subsets of abelian groups with no 3-term arithmetic progression.},
year = {1987},
journal = {J. Comb. Theory, Ser. A},
author = {{Peter Frankl} and {Ronald L. Graham} and {Vojtech Rödl}}
}
@article{journals/jct/FranklGR87a,
title = {Induced restricted Ramsey theorems for spaces.},
year = {1987},
journal = {J. Comb. Theory, Ser. A},
author = {{Peter Frankl} and {Ronald L. Graham} and {Vojtech Rödl}}
}
@article{journals/jct/GyarfasLNRST87,
title = {Local *k*-colorings of graphs and hypergraphs.},
year = {1987},
journal = {J. Comb. Theory, Ser. B},
author = {{András Gyárfás} and {Jenö Lehel} and {Jaroslav Nesetril} and {Vojtech Rödl} and {Richard H. Schelp} and {Zsolt Tuza}}
}
@article{journals/acta/PudlakRS88,
title = {Graph Complexity.},
year = {1988},
journal = {Acta Inf.},
author = {{Pavel Pudlák} and {Vojtech Rödl} and {Petr Savický}}
}
@article{journals/combinatorica/FranklR88,
title = {Some Ramsey - Turán type results for hypergraphs.},
year = {1988},
journal = {Combinatorica},
author = {{Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/gc/MaeharaRRS88,
title = {Embedding of trees in euclidean spaces.},
year = {1988},
journal = {Graphs and Combinatorics},
author = {{Hiroshi Maehara} and {Jan Reiterman} and {Vojtech Rödl} and {Edita Sinajová}}
}
@article{journals/jct/FranklGR88,
title = {Quantitative theorems for regular systems of equations.},
year = {1988},
journal = {J. Comb. Theory, Ser. A},
author = {{Peter Frankl} and {Ronald L. Graham} and {Vojtech Rödl}}
}
@article{journals/jct/FranklRW88,
title = {The number of submatrices of a given type in a Hadamard matrix and related results.},
year = {1988},
journal = {J. Comb. Theory, Ser. B},
author = {{Peter Frankl} and {Vojtech Rödl} and {Richard M. Wilson 0001}}
}
@article{journals/siamdm/PoljakRS88,
title = {Tournament Ranking with Expected Profit in Polynomial Time.},
year = {1988},
journal = {SIAM J. Discrete Math.},
author = {{Svatopluk Poljak} and {Vojtech Rödl} and {Joel Spencer}}
}
@article{journals/dcg/ReitermanRS89,
title = {Embeddings of Graphs in Euclidean Spaces.},
year = {1989},
journal = {Discrete & Computational Geometry},
author = {{Jan Reiterman} and {Vojtech Rödl} and {Edita Sinajová}}
}
@article{journals/dm/ColbournR89,
title = {Percentages in pairwise balanced designs.},
year = {1989},
journal = {Discrete Mathematics},
author = {{Charles J. Colbourn} and {Vojtech Rödl}}
}
@article{journals/dm/NesetrilR89,
title = {The partite construction and ramsey set systems.},
year = {1989},
journal = {Discrete Mathematics},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/dm/ReitermanRS89,
title = {Geometrical embeddings of graphs.},
year = {1989},
journal = {Discrete Mathematics},
author = {{Jan Reiterman} and {Vojtech Rödl} and {Edita Sinajová}}
}
@article{journals/jct/NesetrilR89,
title = {Chromatically optimal rigid graphs.},
year = {1989},
journal = {J. Comb. Theory, Ser. B},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/siamdm/RodlW89,
title = {A Ramsey-Type Theorem for Orderings of a Graph.},
year = {1989},
journal = {SIAM J. Discrete Math.},
author = {{Vojtech Rödl} and {Peter Winkler 0001}}
}
@article{journals/gc/MaeharaR90,
title = {On the dimension to represent a graph by a unit distance graph.},
year = {1990},
journal = {Graphs and Combinatorics},
author = {{Hiroshi Maehara} and {Vojtech Rödl}}
}
@article{journals/gc/Rodl90,
title = {On ramsey families of sets.},
year = {1990},
journal = {Graphs and Combinatorics},
author = {{Vojtech Rödl}}
}
@article{journals/jct/FranklGR90,
title = {Iterated combinatorial density theorems.},
year = {1990},
journal = {J. Comb. Theory, Ser. A},
author = {{Peter Frankl} and {Ronald L. Graham} and {Vojtech Rödl}}
}
@article{journals/tcs/BabaiPRS90,
title = {Lower Bounds to the Complexity of Symmetric Boolean Functions.},
year = {1990},
journal = {Theor. Comput. Sci.},
author = {{László Babai} and {Pavel Pudlák} and {Vojtech Rödl} and {Endre Szemerédi}}
}
@article{journals/combinatorica/ColbournHPRW91,
title = {The number of t-wise balance designs.},
year = {1991},
journal = {Combinatorica},
author = {{Charles J. Colbourn} and {Dean G. Hoffman} and {Kevin T. Phelps} and {Vojtech Rödl} and {Peter Winkler 0001}}
}
@article{journals/jct/BrownR91,
title = {A ramsey type problem concerning vertex colourings.},
year = {1991},
journal = {J. Comb. Theory, Ser. B},
author = {{Jason I. Brown} and {Vojtech Rödl}}
}
@inproceedings{conf/focs/AlonDLRY92,
title = {The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)},
year = {1992},
booktitle = {FOCS},
author = {{Noga Alon} and {Richard A. Duke} and {Hanno Lefmann} and {Vojtech Rödl} and {Raphael Yuster}},
publisher = {IEEE Computer Society},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992}
}
@article{journals/combinatorica/PudlakR92,
title = {A combinatorial approach to complexity.},
year = {1992},
journal = {Combinatorica},
author = {{Pavel Pudlák} and {Vojtech Rödl}}
}
@article{journals/dm/DukeER92,
title = {Cycle-connected graphs.},
year = {1992},
journal = {Discrete Mathematics},
author = {{Richard A. Duke} and {Paul Erdös} and {Vojtech Rödl}}
}
@article{journals/dm/NesetrilR92,
title = {On Ramsey graphs without bipartite subgraphs.},
year = {1992},
journal = {Discrete Mathematics},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/dm/PelantR92,
title = {On coverings of infinite- dimentional metric spaces.},
year = {1992},
journal = {Discrete Mathematics},
author = {{Jan Pelant} and {Vojtech Rödl}}
}
@article{journals/gc/FranekR92,
title = {Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs.},
year = {1992},
journal = {Graphs and Combinatorics},
author = {{Frantisek Franek} and {Vojtech Rödl}}
}
@article{journals/gc/FranklR92,
title = {The Uniformity Lemma for hypergraphs.},
year = {1992},
journal = {Graphs and Combinatorics},
author = {{Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/gc/LefmannRT92,
title = {Monochromatic Vs multicolored paths.},
year = {1992},
journal = {Graphs and Combinatorics},
author = {{Hanno Lefmann} and {Vojtech Rödl} and {Robin Thomas 0001}}
}
@article{journals/jct/ReitermanRS92,
title = {On embedding of graphs into euclidean spaces of small dimension.},
year = {1992},
journal = {J. Comb. Theory, Ser. B},
author = {{Jan Reiterman} and {Vojtech Rödl} and {Edita Sinajová}}
}
@article{journals/rsa/EatonR92,
title = {A Canonical Ramsey Theorem.},
year = {1992},
journal = {Random Struct. Algorithms},
author = {{Nancy Eaton} and {Vojtech Rödl}}
}
@article{journals/rsa/RodlT92,
title = {Rainbow Subgraphs in Properly Edge-colored Graphs.},
year = {1992},
journal = {Random Struct. Algorithms},
author = {{Vojtech Rödl} and {Zsolt Tuza}}
}
@inproceedings{conf/stoc/PudlakR93,
title = {Modified ranks of tensors and the size of circuits.},
year = {1993},
booktitle = {STOC},
author = {{Pavel Pudlák} and {Vojtech Rödl}},
publisher = {ACM},
booktitle = {Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA}
}
@article{journals/dm/FranekR93,
title = {2-Colorings of complete graphs with a small number of monochromatic K_{4} subgraphs.},
year = {1993},
journal = {Discrete Mathematics},
author = {{Frantisek Franek} and {Vojtech Rödl}}
}
@article{journals/dm/GouldR93,
title = {On isomorphic subgraphs.},
year = {1993},
journal = {Discrete Mathematics},
author = {{Ronald J. Gould} and {Vojtech Rödl}}
}
@article{journals/jct/GundersonRS93,
title = {Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.},
year = {1993},
journal = {J. Comb. Theory, Ser. B},
author = {{David S. Gunderson} and {Vojtech Rödl} and {Norbert W. Sauer}}
}
@article{journals/jct/LefmannPR93,
title = {Rigid Linear Binary Codes.},
year = {1993},
journal = {J. Comb. Theory, Ser. A},
author = {{Hanno Lefmann} and {Kevin T. Phelps} and {Vojtech Rödl}}
}
@article{journals/jct/LefmannR93,
title = {On Canonical Ramsey Numbers for Complete Graphs versus Paths.},
year = {1993},
journal = {J. Comb. Theory, Ser. B},
author = {{Hanno Lefmann} and {Vojtech Rödl}}
}
@article{journals/jct/RodlV93,
title = {Monochromatic Trees with Respect to Edge Partitions.},
year = {1993},
journal = {J. Comb. Theory, Ser. B},
author = {{Vojtech Rödl} and {Bernd Voigt}}
}
@article{journals/dm/PudlakR94,
title = {Some combinatorial-algebraic problems from complexity theory.},
year = {1994},
journal = {Discrete Mathematics},
author = {{Pavel Pudlák} and {Vojtech Rödl}}
}
@article{journals/jal/AlonDLRY94,
title = {The Algorithmic Aspects of the Regularity Lemma.},
year = {1994},
journal = {J. Algorithms},
author = {{Noga Alon} and {Richard A. Duke} and {Hanno Lefmann} and {Vojtech Rödl} and {Raphael Yuster}}
}
@article{journals/jct/DukeR94,
title = {The Erdös-Ko-Rado Theorem for Small Families.},
year = {1994},
journal = {J. Comb. Theory, Ser. A},
author = {{Richard A. Duke} and {Vojtech Rödl}}
}
@article{journals/jct/HaddadR94,
title = {Unbalanced Steiner Triple Systems.},
year = {1994},
journal = {J. Comb. Theory, Ser. A},
author = {{Lucien Haddad} and {Vojtech Rödl}}
}
@article{journals/rsa/RodlR94,
title = {Random Graphs with Monochromatic Triangles in Every Edge Coloring.},
year = {1994},
journal = {Random Struct. Algorithms},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/rsa/RodlS94,
title = {Note on Independent Sets in Steiner Systems.},
year = {1994},
journal = {Random Struct. Algorithms},
author = {{Vojtech Rödl} and {Edita Sinajová}}
}
@article{journals/combinatorica/GrablePR95,
title = {The Minimum Independence Number for Designs.},
year = {1995},
journal = {Combinatorica},
author = {{David A. Grable} and {Kevin T. Phelps} and {Vojtech Rödl}}
}
@article{journals/combinatorica/LefmannR95,
title = {On Erdös-Rado Numbers.},
year = {1995},
journal = {Combinatorica},
author = {{Hanno Lefmann} and {Vojtech Rödl}}
}
@article{journals/combinatorica/RodlSZ95,
title = {Ramsey Families which Exclude a Graph.},
year = {1995},
journal = {Combinatorica},
author = {{Vojtech Rödl} and {Norbert Sauer} and {Xuding Zhu}}
}
@article{journals/dm/DuffusLR95,
title = {Shift graphs and lower bounds on Ramsey numbers r_{k}(l; r).},
year = {1995},
journal = {Discrete Mathematics},
author = {{Dwight Duffus} and {Hanno Lefmann} and {Vojtech Rödl}}
}
@article{journals/jct/MatousekR95,
title = {On Ramsey Sets in Spheres.},
year = {1995},
journal = {J. Comb. Theory, Ser. A},
author = {{Jirí Matousek 0001} and {Vojtech Rödl}}
}
@article{journals/jct/PyberRS95,
title = {Dense Graphs without 3-Regular Subgraphs.},
year = {1995},
journal = {J. Comb. Theory, Ser. B},
author = {{László Pyber} and {Vojtech Rödl} and {Endre Szemerédi}}
}
@article{journals/jct/RodlS95,
title = {On the Jumping Constant Conjecture for Multigraphs.},
year = {1995},
journal = {J. Comb. Theory, Ser. A},
author = {{Vojtech Rödl} and {Alexander Sidorenko}}
}
@article{journals/rsa/DuffusGR95,
title = {On the Computational Complexity of Ordered Subgraph Recognition.},
year = {1995},
journal = {Random Struct. Algorithms},
author = {{Dwight Duffus} and {Mark Ginn} and {Vojtech Rödl}}
}
@article{journals/rsa/DukeLR95,
title = {On Uncrowded Hypergraphs.},
year = {1995},
journal = {Random Struct. Algorithms},
author = {{Richard A. Duke} and {Hanno Lefmann} and {Vojtech Rödl}}
}
@article{journals/rsa/ErdosR95,
title = {Covering of r-Graphs by Complete r-Partite Subgraphs.},
year = {1995},
journal = {Random Struct. Algorithms},
author = {{Paul Erdös} and {Vojtech Rödl}}
}
@article{journals/rsa/RodlT95,
title = {On the Genus of a Random Graph.},
year = {1995},
journal = {Random Struct. Algorithms},
author = {{Vojtech Rödl} and {Robin Thomas 0001}}
}
@article{journals/siamcomp/DukeLR95,
title = {A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.},
year = {1995},
journal = {SIAM J. Comput.},
author = {{Richard A. Duke} and {Hanno Lefmann} and {Vojtech Rödl}}
}
@inproceedings{conf/dmtcs/Bertram-Kretzberg96,
title = {Proper Bounded Edge-Colorings.},
year = {1996},
booktitle = {DMTCS},
author = {{Claudia Bertram-Kretzberg} and {Hanno Lefmann} and {Vojtech Rödl} and {Beata Wysocka}},
publisher = {Springer-Verlag, Singapore},
booktitle = {First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, DMTCS 1996, Auckland, New Zealand, December, 9-13, 1996}
}
@article{journals/combinatorica/EatonR96,
title = {Graphs of Small Dimensions.},
year = {1996},
journal = {Combinatorica},
author = {{Nancy Eaton} and {Vojtech Rödl}}
}
@article{journals/dm/KiersteadR96,
title = {Applications of hypergraph coloring to coloring graphs not inducing certain trees.},
year = {1996},
journal = {Discrete Mathematics},
author = {{Hal A. Kierstead} and {Vojtech Rödl}}
}
@article{journals/jct/LefmannRW96,
title = {Multicolored Subsets in Colored Hypergraphs.},
year = {1996},
journal = {J. Comb. Theory, Ser. A},
author = {{Hanno Lefmann} and {Vojtech Rödl} and {Beata Wysocka}}
}
@article{journals/jct/LuczakR96,
title = {On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree.},
year = {1996},
journal = {J. Comb. Theory, Ser. B},
author = {{Tomasz Luczak} and {Vojtech Rödl}}
}
@article{journals/jgt/EatonGR96,
title = {On *p*-intersection representations.},
year = {1996},
journal = {Journal of Graph Theory},
author = {{Nancy Eaton} and {Ronald J. Gould} and {Vojtech Rödl}}
}
@article{journals/jgt/KohayakawaLR96,
title = {Ramsey-type results for oriented trees.},
year = {1996},
journal = {Journal of Graph Theory},
author = {{Yoshiharu Kohayakawa} and {Tomasz Luczak} and {Vojtech Rödl}}
}
@article{journals/rsa/RodlT96,
title = {Asymptotic packing and the random greedy algorithm.},
year = {1996},
journal = {Random Struct. Algorithms},
author = {{Vojtech Rödl} and {Lubos Thoma}}
}
@article{journals/combinatorica/KohayakawaLR97,
title = {On *K*^{4}-Free Subgraphs of Random Graphs.},
year = {1997},
journal = {Combinatorica},
author = {{Yoshiharu Kohayakawa} and {Tomasz Luczak} and {Vojtech Rödl}}
}
@article{journals/cpc/RodlR97,
title = {Bipartite Coverings of Graphs.},
year = {1997},
journal = {Combinatorics, Probability & Computing},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/ejc/SauerWR97,
title = {Chromatic Ramsey Theory.},
year = {1997},
journal = {Eur. J. Comb.},
author = {{Norbert Sauer} and {Robert E. Woodrow} and {Vojtech Rödl}}
}
@article{journals/jct/RodlT97,
title = {On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems.},
year = {1997},
journal = {J. Comb. Theory, Ser. A},
author = {{Vojtech Rödl} and {Lubos Thoma}}
}
@article{journals/jgt/RodlW97,
title = {Note on regular subgraphs.},
year = {1997},
journal = {Journal of Graph Theory},
author = {{Vojtech Rödl} and {Beata Wysocka}}
}
@article{journals/siamcomp/PudlakRS97,
title = {Boolean Circuits, Tensor Ranks, and Communication Complexity.},
year = {1997},
journal = {SIAM J. Comput.},
author = {{Pavel Pudlák} and {Vojtech Rödl} and {Jirí Sgall}}
}
@inproceedings{conf/random/RodlRW98,
title = {An Algorithmic Embedding of Graphs via Perfect Matchings.},
year = {1998},
booktitle = {RANDOM},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001} and {Michelle Wagner}},
publisher = {Springer},
booktitle = {Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings}
}
@article{journals/combinatorica/KohayakawaPR98,
title = {Induced Ramsey Numbers.},
year = {1998},
journal = {Combinatorica},
author = {{Yoshiharu Kohayakawa} and {Hans Jürgen Prömel} and {Vojtech Rödl}}
}
@article{journals/combinatorica/KostochkaR98,
title = {On Large Systems of Sets with No Large Weak -subsystems.},
year = {1998},
journal = {Combinatorica},
author = {{Alexandr V. Kostochka} and {Vojtech Rödl}}
}
@article{journals/combinatorics/AlonRR98,
title = {Perfect Matchings in ε-regular Graphs.},
year = {1998},
journal = {Electr. J. Comb.},
author = {{Noga Alon} and {Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/cpc/DuffusLRR98,
title = {Endomorphisms of Partially Ordered Sets.},
year = {1998},
journal = {Combinatorics, Probability & Computing},
author = {{Dwight Duffus} and {Tomasz Luczak} and {Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/cpc/GundersonR98,
title = {Extremal Problems for Affine Cubes of Integers.},
year = {1998},
journal = {Combinatorics, Probability & Computing},
author = {{David S. Gunderson} and {Vojtech Rödl}}
}
@article{journals/cpc/LuczakVRS98,
title = {Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.},
year = {1998},
journal = {Combinatorics, Probability & Computing},
author = {{Tomasz Luczak} and {Vojtech Rödl} and {Endre Szemerédi}}
}
@article{journals/dm/LuczakRS98,
title = {Independent finite sums in graphs defined on the natural numbers.},
year = {1998},
journal = {Discrete Mathematics},
author = {{Tomasz Luczak} and {Vojtech Rödl} and {Tomasz Schoen}}
}
@article{journals/jct/RodlR98,
title = {Ramsey Properties of Random Hypergraphs.},
year = {1998},
journal = {J. Comb. Theory, Ser. A},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/rsa/KostochkaR98,
title = {Partial Steiner systems and matchings in hypergraphs.},
year = {1998},
journal = {Random Struct. Algorithms},
author = {{Alexandr V. Kostochka} and {Vojtech Rödl}}
}
@article{journals/combinatorica/RodlR99,
title = {Perfect Matchings in -Regular Graphs and the Blow-Up Lemma.},
year = {1999},
journal = {Combinatorica},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/cpc/RodlRT99,
title = {Hypergraph Packing And Graph Embedding.},
year = {1999},
journal = {Combinatorics, Probability & Computing},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001} and {Anusch Taraz}}
}
@article{journals/jct/GundersonRS99,
title = {Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs.},
year = {1999},
journal = {J. Comb. Theory, Ser. A},
author = {{David S. Gunderson} and {Vojtech Rödl} and {Alexander Sidorenko}}
}
@article{journals/jct/PromelR99,
title = {Non-Ramsey Graphs Are c log n-Universal.},
year = {1999},
journal = {J. Comb. Theory, Ser. A},
author = {{Hans Jürgen Prömel} and {Vojtech Rödl}}
}
@article{journals/siamdm/CzygrinowPR99,
title = {Constructive Quasi-Ramsey Numbers and Tournament Ranking.},
year = {1999},
journal = {SIAM J. Discrete Math.},
author = {{Andrzej Czygrinow} and {Svatopluk Poljak} and {Vojtech Rödl}}
}
@inproceedings{conf/focs/AlonCKRRS00,
title = {Universality and Tolerance.},
year = {2000},
booktitle = {FOCS},
author = {{Noga Alon} and {Michael R. Capalbo} and {Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Andrzej Rucinski 0001} and {Endre Szemerédi}},
publisher = {IEEE Computer Society},
booktitle = {41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA}
}
@inproceedings{conf/latin/KohayakawaR00,
title = {Algorithmic Aspects of Regularity.},
year = {2000},
booktitle = {LATIN},
author = {{Yoshiharu Kohayakawa} and {Vojtech Rödl}},
publisher = {Springer},
booktitle = {LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings}
}
@inproceedings{conf/latin/KohayakawaRS00,
title = {Equivalent Conditions for Regularity (Extended Abstract).},
year = {2000},
booktitle = {LATIN},
author = {{Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Jozef Skokan}},
publisher = {Springer},
booktitle = {LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings}
}
@article{journals/combinatorica/RodlS00,
title = {On Size Ramsey Numbers of Graphs with Bounded Degree.},
year = {2000},
journal = {Combinatorica},
author = {{Vojtech Rödl} and {Endre Szemerédi}}
}
@article{journals/jgt/GrahamR000,
title = {On graphs with linear Ramsey numbers.},
year = {2000},
journal = {Journal of Graph Theory},
author = {{Ronald L. Graham} and {Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/siamcomp/CzygrinowR00,
title = {An Algorithmic Regularity Lemma for Hypergraphs.},
year = {2000},
journal = {SIAM J. Comput.},
author = {{Andrzej Czygrinow} and {Vojtech Rödl}}
}
@inproceedings{conf/random/AlonCKRRS01,
title = {Near-optimum Universal Graphs for Graphs with Bounded Degrees.},
year = {2001},
booktitle = {RANDOM-APPROX},
author = {{Noga Alon} and {Michael R. Capalbo} and {Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Andrzej Rucinski 0001} and {Endre Szemerédi}},
publisher = {Springer},
booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings}
}
@article{journals/combinatorica/GrahamRR01,
title = {On Bipartite Graphs with Linear Ramsey Numbers.},
year = {2001},
journal = {Combinatorica},
author = {{Ronald L. Graham} and {Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/combinatorica/HaxellR01,
title = {Integer and Fractional Packings in Dense Graphs.},
year = {2001},
journal = {Combinatorica},
author = {{Penny E. Haxell} and {Vojtech Rödl}}
}
@article{journals/dm/NagleR01,
title = {The asymptotic number of triple systems not containing a fixed one.},
year = {2001},
journal = {Discrete Mathematics},
author = {{Brendan Nagle} and {Vojtech Rödl}}
}
@article{journals/jct/GundersonLPR01,
title = {Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers.},
year = {2001},
journal = {J. Comb. Theory, Ser. A},
author = {{David S. Gunderson} and {Imre Leader} and {Hans Jürgen Prömel} and {Vojtech Rödl}}
}
@article{journals/jgt/KostochkaR01,
title = {On graphs with small Ramsey numbers.},
year = {2001},
journal = {Journal of Graph Theory},
author = {{Alexandr V. Kostochka} and {Vojtech Rödl}}
}
@article{journals/rsa/KostochkaMRT01,
title = {On the chromatic number of set systems.},
year = {2001},
journal = {Random Struct. Algorithms},
author = {{Alexandr V. Kostochka} and {Dhruv Mubayi} and {Vojtech Rödl} and {Prasad Tetali}}
}
@article{journals/siamcomp/RodlRW01,
title = {Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma.},
year = {2001},
journal = {SIAM J. Comput.},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001} and {Michelle Wagner}}
}
@inproceedings{conf/icalp/KohayakawaNR02,
title = {Efficient Testing of Hypergraphs.},
year = {2002},
booktitle = {ICALP},
author = {{Yoshiharu Kohayakawa} and {Brendan Nagle} and {Vojtech Rödl}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings}
}
@inproceedings{conf/soda/KohayakawaRT02,
title = {An optimal algorithm for checking regularity (extended abstract).},
year = {2002},
booktitle = {SODA},
author = {{Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Lubos Thoma}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA.}
}
@article{journals/combinatorics/PengRR02,
title = {Holes in Graphs.},
year = {2002},
journal = {Electr. J. Comb.},
author = {{Yuejian Peng} and {Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/jct/GrahamLRR02,
title = {Ramsey Properties of Families of Graphs.},
year = {2002},
journal = {J. Comb. Theory, Ser. B},
author = {{Ronald L. Graham} and {Tomasz Luczak} and {Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/jct/KohayakawaRS02,
title = {Hypergraphs, Quasi-randomness, and Conditions for Regularity.},
year = {2002},
journal = {J. Comb. Theory, Ser. A},
author = {{Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Jozef Skokan}}
}
@article{journals/jct/MubayiR02,
title = {On the Turán Number of Triple Systems.},
year = {2002},
journal = {J. Comb. Theory, Ser. A},
author = {{Dhruv Mubayi} and {Vojtech Rödl}}
}
@article{journals/rsa/DementievaHNR02,
title = {On characterizing hypergraph regularity.},
year = {2002},
journal = {Random Struct. Algorithms},
author = {{Y. Dementieva} and {Penny E. Haxell} and {Brendan Nagle} and {Vojtech Rödl}}
}
@article{journals/rsa/FranklR02,
title = {Extremal problems on set systems.},
year = {2002},
journal = {Random Struct. Algorithms},
author = {{Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/cpc/FriedgutKRRT03,
title = {Ramsey Games Against a One-Armed Bandit.},
year = {2003},
journal = {Combinatorics, Probability & Computing},
author = {{Ehud Friedgut} and {Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Andrzej Rucinski 0001} and {Prasad Tetali}}
}
@article{journals/cpc/KohayakawaNR03,
title = {Hereditary Properties Of Triple Systems.},
year = {2003},
journal = {Combinatorics, Probability & Computing},
author = {{Yoshiharu Kohayakawa} and {Brendan Nagle} and {Vojtech Rödl}}
}
@article{journals/jct/GundersonLPR03,
title = {Independent Deuber sets in graphs on the natural numbers.},
year = {2003},
journal = {J. Comb. Theory, Ser. A},
author = {{David S. Gunderson} and {Imre Leader} and {Hans Jürgen Prömel} and {Vojtech Rödl}}
}
@article{journals/jct/Rodl03,
title = {On homogeneous sets of positive integers.},
year = {2003},
journal = {J. Comb. Theory, Ser. A},
author = {{Vojtech Rödl}}
}
@article{journals/rsa/DukeER03,
title = {On large intersecting subfamilies of uniform setfamilies.},
year = {2003},
journal = {Random Struct. Algorithms},
author = {{Richard A. Duke} and {Paul Erdös} and {Vojtech Rödl}}
}
@article{journals/rsa/HaxellNR03,
title = {Integer and fractional packings in dense 3-uniform hypergraphs.},
year = {2003},
journal = {Random Struct. Algorithms},
author = {{Penny E. Haxell} and {Brendan Nagle} and {Vojtech Rödl}}
}
@article{journals/rsa/KohayakawaR03,
title = {Regular pairs in sparse random graphs I.},
year = {2003},
journal = {Random Struct. Algorithms},
author = {{Yoshiharu Kohayakawa} and {Vojtech Rödl}}
}
@article{journals/rsa/NagleR03,
title = {Regularity properties for triple systems.},
year = {2003},
journal = {Random Struct. Algorithms},
author = {{Brendan Nagle} and {Vojtech Rödl}}
}
@article{journals/siamcomp/KohayakawaRT03,
title = {An Optimal Algorithm for Checking Regularity.},
year = {2003},
journal = {SIAM J. Comput.},
author = {{Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Lubos Thoma}}
}
@article{journals/combinatorica/KostochkaR04,
title = {On Graphs With Small Ramsey Numbers, II.},
year = {2004},
journal = {Combinatorica},
author = {{Alexandr V. Kostochka} and {Vojtech Rödl}}
}
@article{journals/combinatorics/MubayiR04,
title = {Uniform Edge Distribution in Hypergraphs is Hereditary.},
year = {2004},
journal = {Electr. J. Comb.},
author = {{Dhruv Mubayi} and {Vojtech Rödl}}
}
@article{journals/cpc/KohayakawaRS04,
title = {The Turán Theorem for Random Graphs.},
year = {2004},
journal = {Combinatorics, Probability & Computing},
author = {{Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/rsa/RodlS04,
title = {Regularity Lemma for k-uniform hypergraphs.},
year = {2004},
journal = {Random Struct. Algorithms},
author = {{Vojtech Rödl} and {Jozef Skokan}}
}
@inproceedings{conf/focs/HaxellNR05,
title = {An Algorithmic Version of the Hypergraph Regularity Method.},
year = {2005},
booktitle = {FOCS},
author = {{Penny E. Haxell} and {Brendan Nagle} and {Vojtech Rödl}},
publisher = {IEEE Computer Society},
booktitle = {46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings}
}
@inproceedings{conf/mfcs/SzemerediRR05,
title = {The Generalization of Dirac's Theorem for Hypergraphs.},
year = {2005},
booktitle = {MFCS},
author = {{Endre Szemerédi} and {Andrzej Rucinski 0001} and {Vojtech Rödl}},
publisher = {Springer},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings}
}
@article{journals/combinatorica/AlonR05,
title = {Sharp Bounds For Some Multicolor Ramsey Numbers.},
year = {2005},
journal = {Combinatorica},
author = {{Noga Alon} and {Vojtech Rödl}}
}
@article{journals/cpc/FerraraKR05,
title = {Distance Graphs on the Integers.},
year = {2005},
journal = {Combinatorics, Probability & Computing},
author = {{Mike Ferrara} and {Yoshiharu Kohayakawa} and {Vojtech Rödl}}
}
@article{journals/cpc/PengRS05,
title = {Counting Small Cliques in 3-uniform Hypergraphs.},
year = {2005},
journal = {Combinatorics, Probability & Computing},
author = {{Yuejian Peng} and {Vojtech Rödl} and {Jozef Skokan}}
}
@article{journals/cpc/RodlT05,
title = {On Cover Graphs and Dependent Arcs in Acyclic Orientations.},
year = {2005},
journal = {Combinatorics, Probability & Computing},
author = {{Vojtech Rödl} and {Lubos Thoma}}
}
@article{journals/endm/AvartRS05,
title = {Every Monotone 3-Graph Property is Testable.},
year = {2005},
journal = {Electronic Notes in Discrete Mathematics},
author = {{Christian Avart} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/rsa/RodlS05,
title = {Counting subgraphs in quasi-random 4-uniform hypergraphs.},
year = {2005},
journal = {Random Struct. Algorithms},
author = {{Vojtech Rödl} and {Jozef Skokan}}
}
@article{journals/combinatorica/MubayiR06,
title = {Supersaturation For Ramsey-Turán Problems.},
year = {2006},
journal = {Combinatorica},
author = {{Dhruv Mubayi} and {Vojtech Rödl}}
}
@article{journals/cpc/AlonKMMR06,
title = {Measures of Pseudorandomness for Finite Sequences: Minimal Values.},
year = {2006},
journal = {Combinatorics, Probability & Computing},
author = {{Noga Alon} and {Yoshiharu Kohayakawa} and {Christian Mauduit} and {Carlos Gustavo T. de A. Moreira} and {Vojtech Rödl}}
}
@article{journals/cpc/RodlRS06,
title = {A Dirac-Type Theorem for 3-Uniform Hypergraphs.},
year = {2006},
journal = {Combinatorics, Probability & Computing},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001} and {Endre Szemerédi}}
}
@article{journals/ejc/RodlRS06,
title = {Perfect matchings in uniform hypergraphs with large minimum degree.},
year = {2006},
journal = {Eur. J. Comb.},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001} and {Endre Szemerédi}}
}
@article{journals/jct/HaxelllPRRSS06,
title = {The Ramsey number for hypergraph cycles I.},
year = {2006},
journal = {J. Comb. Theory, Ser. A},
author = {{Penny E. Haxell} and {Tomasz Luczak} and {Yuejian Peng} and {Vojtech Rödl} and {Andrzej Rucinski 0001} and {Miklós Simonovits} and {Jozef Skokan}}
}
@article{journals/jct/KostochkaR06,
title = {On Ramsey numbers of uniform hypergraphs with given maximum degree.},
year = {2006},
journal = {J. Comb. Theory, Ser. A},
author = {{Alexandr V. Kostochka} and {Vojtech Rödl}}
}
@article{journals/jct/PolcynRRS06,
title = {Short paths in quasi-random triple systems with sparse underlying graphs.},
year = {2006},
journal = {J. Comb. Theory, Ser. B},
author = {{Joanna Polcyn} and {Vojtech Rödl} and {Andrzej Rucinski 0001} and {Endre Szemerédi}}
}
@article{journals/jct/RodlT06,
title = {A note on a conjecture by Füredi.},
year = {2006},
journal = {J. Comb. Theory, Ser. A},
author = {{Vojtech Rödl} and {Eduardo Tengan}}
}
@article{journals/jgt/RodlS06,
title = {Color critical hypergraphs with many edges.},
year = {2006},
journal = {Journal of Graph Theory},
author = {{Vojtech Rödl} and {Mark H. Siggers}}
}
@article{journals/rsa/NagleRS06,
title = {The counting lemma for regular *k*-uniform hypergraphs.},
year = {2006},
journal = {Random Struct. Algorithms},
author = {{Brendan Nagle} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/rsa/RodlS06,
title = {Applications of the regularity lemma for uniform hypergraphs.},
year = {2006},
journal = {Random Struct. Algorithms},
author = {{Vojtech Rödl} and {Jozef Skokan}}
}
@inproceedings{conf/icalp/AlonCHKRS07,
title = {Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.},
year = {2007},
booktitle = {ICALP},
author = {{Noga Alon} and {Amin Coja-Oghlan} and {Hiêp Hàn} and {Mihyun Kang} and {Vojtech Rödl} and {Mathias Schacht}},
publisher = {Springer},
booktitle = {Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings}
}
@inproceedings{conf/stoc/RodlS07,
title = {Property testing in hypergraphs and the removal lemma.},
year = {2007},
booktitle = {STOC},
author = {{Vojtech Rödl} and {Mathias Schacht}},
publisher = {ACM},
booktitle = {Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007}
}
@article{journals/cpc/RodlS07,
title = {Regular Partitions of Hypergraphs: Regularity Lemmas.},
year = {2007},
journal = {Combinatorics, Probability & Computing},
author = {{Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/cpc/RodlS07a,
title = {Regular Partitions of Hypergraphs: Counting Lemmas.},
year = {2007},
journal = {Combinatorics, Probability & Computing},
author = {{Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/jct/FranklPRT07,
title = {A note on the jumping constant conjecture of Erdös.},
year = {2007},
journal = {J. Comb. Theory, Ser. B},
author = {{Peter Frankl} and {Yuejian Peng} and {Vojtech Rödl} and {John M. Talbot}}
}
@article{journals/jct/GerkeKRS07,
title = {Small subsets inherit sparse epsilon-regularity.},
year = {2007},
journal = {J. Comb. Theory, Ser. B},
author = {{Stefanie Gerke} and {Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Angelika Steger}}
}
@article{journals/jct/KohayakawaRSSS07,
title = {Turán's theorem for pseudo-random graphs.},
year = {2007},
journal = {J. Comb. Theory, Ser. A},
author = {{Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Mathias Schacht} and {Papa Sissokho} and {Jozef Skokan}}
}
@article{journals/jct/MubayiR07,
title = {On the chromatic number and independence number of hypergraph products.},
year = {2007},
journal = {J. Comb. Theory, Ser. B},
author = {{Dhruv Mubayi} and {Vojtech Rödl}}
}
@article{journals/jct/RodlSST07,
title = {Integer and fractional packings of hypergraphs.},
year = {2007},
journal = {J. Comb. Theory, Ser. B},
author = {{Vojtech Rödl} and {Mathias Schacht} and {Mark H. Siggers} and {Norihide Tokushige}}
}
@article{journals/siamdm/AvartRS07,
title = {Every Monotone 3-Graph Property is Testable.},
year = {2007},
journal = {SIAM J. Discrete Math.},
author = {{Christian Avart} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/siamdm/RodlRS07,
title = {Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.},
year = {2007},
journal = {SIAM J. Discrete Math.},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001} and {Mathias Schacht}}
}
@inproceedings{conf/latin/DudekR08,
title = {New Upper Bound on Vertex Folkman Numbers.},
year = {2008},
booktitle = {LATIN},
author = {{Andrzej Dudek} and {Vojtech Rödl}},
publisher = {Springer},
booktitle = {LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings}
}
@inproceedings{conf/soda/DellamonicaKRR08,
title = {Universality of random graphs.},
year = {2008},
booktitle = {SODA},
author = {{Domingos Dellamonica Jr.} and {Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Andrzej Rucinski 0001}},
publisher = {SIAM},
booktitle = {Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}
}
@article{journals/combinatorica/RodlSR08,
title = {An approximate Dirac-type theorem for *k* -uniform hypergraphs.},
year = {2008},
journal = {Combinatorica},
author = {{Vojtech Rödl} and {Endre Szemerédi} and {Andrzej Rucinski 0001}}
}
@article{journals/combinatorics/DudekR08,
title = {On the Turán Properties of Infinite Graphs.},
year = {2008},
journal = {Electr. J. Comb.},
author = {{Andrzej Dudek} and {Vojtech Rödl}}
}
@article{journals/dm/NagleRS08,
title = {Note on the 3-graph counting lemma.},
year = {2008},
journal = {Discrete Mathematics},
author = {{Brendan Nagle} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/em/DudekR08,
title = {On the Folkman Number *f*(2, 3, 4).},
year = {2008},
journal = {Experimental Mathematics},
author = {{Andrzej Dudek} and {Vojtech Rödl}}
}
@article{journals/endm/AvartKLR08,
title = {Colorful Flowers.},
year = {2008},
journal = {Electronic Notes in Discrete Mathematics},
author = {{Christian Avart} and {Péter Komjáth} and {Tomasz Luczak} and {Vojtech Rödl}}
}
@article{journals/endm/DudekR08,
title = {Finding Folkman Numbers via MAX CUT Problem.},
year = {2008},
journal = {Electronic Notes in Discrete Mathematics},
author = {{Andrzej Dudek} and {Vojtech Rödl}}
}
@article{journals/gc/NagleORS08,
title = {On the Ramsey Number of Sparse 3-Graphs.},
year = {2008},
journal = {Graphs and Combinatorics},
author = {{Brendan Nagle} and {Sayaka Olsen} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/im/ZichKRS08,
title = {JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness.},
year = {2008},
journal = {Internet Mathematics},
author = {{Jan Zich} and {Yoshiharu Kohayakawa} and {Vojtech Rödl} and {V. Sunderam}}
}
@article{journals/jgt/RodlZ08,
title = {Triangulations and the Hajós conjecture.},
year = {2008},
journal = {Journal of Graph Theory},
author = {{Vojtech Rödl} and {Jan Zich}}
}
@article{journals/siamdm/RodlS08,
title = {On Ramsey Minimal Graphs.},
year = {2008},
journal = {SIAM J. Discrete Math.},
author = {{Vojtech Rödl} and {Mark H. Siggers}}
}
@inproceedings{conf/soda/NaglePRS09,
title = {Hypergraph regularity and quasi-randomness.},
year = {2009},
booktitle = {SODA},
author = {{Brendan Nagle} and {Annika Poerschke} and {Vojtech Rödl} and {Mathias Schacht}},
publisher = {SIAM},
booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009}
}
@article{journals/combinatorica/RodlS09,
title = {Generalizations of the removal lemma.},
year = {2009},
journal = {Combinatorica},
author = {{Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/cpc/DudekFR09,
title = {A Note on Universal and Canonically Coloured Sequences.},
year = {2009},
journal = {Combinatorics, Probability & Computing},
author = {{Andrzej Dudek} and {Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/cpc/HaxellLPRRS09,
title = {The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.},
year = {2009},
journal = {Combinatorics, Probability & Computing},
author = {{Penny E. Haxell} and {Tomasz Luczak} and {Yuejian Peng} and {Vojtech Rödl} and {Andrzej Rucinski 0001} and {Jozef Skokan}}
}
@article{journals/cpc/LefmannPRS09,
title = {On Colourings of Hypergraphs Without Monochromatic Fano Planes.},
year = {2009},
journal = {Combinatorics, Probability & Computing},
author = {{Hanno Lefmann} and {Yury Person} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/dm/DudekNR09,
title = {On k-chromatically connected graphs.},
year = {2009},
journal = {Discrete Mathematics},
author = {{Andrzej Dudek} and {Esmeralda Nastase} and {Vojtech Rödl}}
}
@article{journals/endm/DellamonicaR09,
title = {Hereditary quasi-random properties of hypergraphs.},
year = {2009},
journal = {Electronic Notes in Discrete Mathematics},
author = {{Domingos Dellamonica Jr.} and {Vojtech Rödl}}
}
@article{journals/ijac/KoubekRS09,
title = {Representing Subdirect Product Monoids by Graphs.},
year = {2009},
journal = {IJAC},
author = {{Václav Koubek} and {Vojtech Rödl} and {Benjamin Shemmer}}
}
@article{journals/jct/RodlRS09,
title = {Perfect matchings in large uniform hypergraphs with large minimum collective degree.},
year = {2009},
journal = {J. Comb. Theory, Ser. A},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001} and {Endre Szemerédi}}
}
@article{journals/jgt/KoubekRS09,
title = {On graphs with a given endomorphism monoid.},
year = {2009},
journal = {Journal of Graph Theory},
author = {{Václav Koubek} and {Vojtech Rödl} and {Benjamin Shemmer}}
}
@article{journals/dm/KoubekR10,
title = {On the number of graphs with a given endomorphism monoid.},
year = {2010},
journal = {Discrete Mathematics},
author = {{Václav Koubek} and {Vojtech Rödl}}
}
@article{journals/dm/NastaseRS10,
title = {Note on robust critical graphs with large odd girth.},
year = {2010},
journal = {Discrete Mathematics},
author = {{Esmeralda Nastase} and {Vojtech Rödl} and {Mark H. Siggers}}
}
@article{journals/jct/DudekR10,
title = {An almost quadratic bound on vertex Folkman numbers.},
year = {2010},
journal = {J. Comb. Theory, Ser. B},
author = {{Andrzej Dudek} and {Vojtech Rödl}}
}
@article{journals/jct/KohayakawaNRS10,
title = {Weak hypergraph regularity and linear hypergraphs.},
year = {2010},
journal = {J. Comb. Theory, Ser. B},
author = {{Yoshiharu Kohayakawa} and {Brendan Nagle} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/jct/KostochkaPR10,
title = {Some constructive bounds on Ramsey numbers.},
year = {2010},
journal = {J. Comb. Theory, Ser. B},
author = {{Alexandr V. Kostochka} and {Pavel Pudlák} and {Vojtech Rödl}}
}
@article{journals/rsa/FriedgutRS10,
title = {Ramsey properties of random discrete structures.},
year = {2010},
journal = {Random Struct. Algorithms},
author = {{Ehud Friedgut} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/rsa/KostochkaR10,
title = {Constructions of sparse uniform hypergraphs with high chromatic number.},
year = {2010},
journal = {Random Struct. Algorithms},
author = {{Alexandr V. Kostochka} and {Vojtech Rödl}}
}
@inproceedings{conf/approx/DellamonicaKMRS11,
title = {A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.},
year = {2011},
booktitle = {APPROX-RANDOM},
author = {{Domingos Dellamonica Jr.} and {Subrahmanyam Kalyanasundaram} and {Daniel M. Martin} and {Vojtech Rödl} and {Asaf Shapira}},
publisher = {Springer},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings}
}
@inproceedings{conf/soda/KohayakawaLR11,
title = {The maximum size of a Sidon set contained in a sparse random set of integers.},
year = {2011},
booktitle = {SODA},
author = {{Yoshiharu Kohayakawa} and {Sangjune Lee} and {Vojtech Rödl}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011}
}
@article{journals/combinatorica/DellamonicaR11,
title = {Hereditary quasirandom properties of hypergraphs.},
year = {2011},
journal = {Combinatorica},
author = {{Domingos Dellamonica Jr.} and {Vojtech Rödl}}
}
@article{journals/combinatorica/DudekR11,
title = {On *K*_{s}-free subgraphs in *K*_{s+k}-free graphs and vertex Folkman numbers.},
year = {2011},
journal = {Combinatorica},
author = {{Andrzej Dudek} and {Vojtech Rödl}}
}
@article{journals/ejc/DuffusFR11,
title = {Maximal independent sets in bipartite graphs obtained from Boolean lattices.},
year = {2011},
journal = {Eur. J. Comb.},
author = {{Dwight Duffus} and {Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/jct/DellamonicaR11,
title = {A note on Thomassenʼs conjecture.},
year = {2011},
journal = {J. Comb. Theory, Ser. B},
author = {{Domingos Dellamonica Jr.} and {Vojtech Rödl}}
}
@article{journals/jgt/DellamonicaKMR11,
title = {On a conjecture of Thomassen concerning subgraphs of large girth.},
year = {2011},
journal = {Journal of Graph Theory},
author = {{Domingos Dellamonica Jr.} and {Václav Koubek} and {Daniel M. Martin} and {Vojtech Rödl}}
}
@inproceedings{conf/latin/DellamonicaKRR12,
title = {An Improved Upper Bound on the Density of Universal Random Graphs.},
year = {2012},
booktitle = {LATIN},
author = {{Domingos Dellamonica Jr.} and {Yoshiharu Kohayakawa} and {Vojtech Rödl} and {Andrzej Rucinski 0001}},
publisher = {Springer},
booktitle = {LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings}
}
@article{journals/cpc/DellamonicaHLMNPRSV12,
title = {On Even-Degree Subgraphs of Linear Hypergraphs.},
year = {2012},
journal = {Combinatorics, Probability & Computing},
author = {{Domingos Dellamonica Jr.} and {Penny E. Haxell} and {Tomasz Luczak} and {Dhruv Mubayi} and {Brendan Nagle} and {Yury Person} and {Vojtech Rödl} and {Mathias Schacht} and {Jacques Verstraëte}}
}
@article{journals/cpc/DellamonicaR12,
title = {Distance Preserving Ramsey Graphs.},
year = {2012},
journal = {Combinatorics, Probability & Computing},
author = {{Domingos Dellamonica Jr.} and {Vojtech Rödl}}
}
@article{journals/cpc/FranklRR12,
title = {On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.},
year = {2012},
journal = {Combinatorics, Probability & Computing},
author = {{Peter Frankl} and {Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/jct/AlonFHRRS12,
title = {Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.},
year = {2012},
journal = {J. Comb. Theory, Ser. A},
author = {{Noga Alon} and {Peter Frankl} and {Hao Huang} and {Vojtech Rödl} and {Andrzej Rucinski 0001} and {Benny Sudakov}}
}
@article{journals/rsa/DudekRR12,
title = {On induced Folkman numbers.},
year = {2012},
journal = {Random Struct. Algorithms},
author = {{Andrzej Dudek} and {Reshma Ramadurai} and {Vojtech Rödl}}
}
@article{journals/rsa/RodlS12,
title = {Complete Partite subgraphs in dense hypergraphs.},
year = {2012},
journal = {Random Struct. Algorithms},
author = {{Vojtech Rödl} and {Mathias Schacht}}
}
@incollection{books/daglib/p/Rodl013,
title = {Arrangeability and Clique Subdivisions.},
year = {2013},
booktitle = {The Mathematics of Paul Erdős II},
author = {{Vojtech Rödl} and {Robin Thomas 0001}},
publisher = {Springer},
booktitle = {The Mathematics of Paul Erdős II}
}
@inproceedings{conf/icalp/LauriaPRT13,
title = {The Complexity of Proving That a Graph Is Ramsey.},
year = {2013},
booktitle = {ICALP (1)},
author = {{Massimo Lauria} and {Pavel Pudlák} and {Vojtech Rödl} and {Neil Thapen}},
publisher = {Springer},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I}
}
@article{journals/combinatorics/BhatR13,
title = {Note on Upper Density of Quasi-Random Hypergraphs.},
year = {2013},
journal = {Electr. J. Comb.},
author = {{Vindya Bhat} and {Vojtech Rödl}}
}
@article{journals/dam/DudekFR13,
title = {Some recent results on Ramsey-type numbers.},
year = {2013},
journal = {Discrete Applied Mathematics},
author = {{Andrzej Dudek} and {Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/dam/DuffusFR13,
title = {Maximal independent sets in the covering graph of the cube.},
year = {2013},
journal = {Discrete Applied Mathematics},
author = {{Dwight Duffus} and {Peter Frankl} and {Vojtech Rödl}}
}
@article{journals/pmh/AvartKR13,
title = {Note on the point character of *l* _{1}-spaces.},
year = {2013},
journal = {Periodica Mathematica Hungarica},
author = {{Christian Avart} and {Péter Komjáth} and {Vojtech Rödl}}
}
@article{journals/siamdm/HornFR13,
title = {Jumps and Nonjumps in Multigraphs.},
year = {2013},
journal = {SIAM J. Discrete Math.},
author = {{Paul Horn} and {Steve La Fleur} and {Vojtech Rödl}}
}
@article{journals/combinatorics/HornMR14,
title = {Degree Ramsey Numbers of Closed Blowups of Trees.},
year = {2014},
journal = {Electr. J. Comb.},
author = {{Paul Horn} and {Kevin G. Milans} and {Vojtech Rödl}}
}
@article{journals/dmgt/Rodl014,
title = {Families of triples with high minimum degree are Hamiltonian.},
year = {2014},
journal = {Discussiones Mathematicae Graph Theory},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001}}
}
@article{journals/jct/DudekRR14,
title = {On generalized Ramsey numbers of Erdős and Rogers.},
year = {2014},
journal = {J. Comb. Theory, Ser. B},
author = {{Andrzej Dudek} and {Troy Retter} and {Vojtech Rödl}}
}
@article{journals/cpc/DellamonicaKMRS15,
title = {An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.},
year = {2015},
journal = {Combinatorics, Probability & Computing},
author = {{Domingos Dellamonica Jr.} and {Subrahmanyam Kalyanasundaram} and {Daniel M. Martin} and {Vojtech Rödl} and {Asaf Shapira}}
}
@article{journals/endm/HanRRS15,
title = {Ramsey-type numbers involving graphs and hypergraphs with large girth.},
year = {2015},
journal = {Electronic Notes in Discrete Mathematics},
author = {{Hiêp Hàn} and {Troy Retter} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/endm/MessutiRS15,
title = {Packing minor closed families of graphs.},
year = {2015},
journal = {Electronic Notes in Discrete Mathematics},
author = {{Silvia Messuti} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/rsa/KohayakawaLRS15,
title = {The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers.},
year = {2015},
journal = {Random Struct. Algorithms},
author = {{Yoshiharu Kohayakawa} and {Sangjune Lee} and {Vojtech Rödl} and {Wojciech Samotij}}
}
@inproceedings{conf/soda/NagleRS16,
title = {An Algorithmic Hypergraph Regularity Lemma.},
year = {2016},
booktitle = {SODA},
author = {{Brendan Nagle} and {Vojtech Rödl} and {Mathias Schacht}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016}
}
@article{journals/cpc/DellamonicaKLRS16,
title = {On the Number of *B*_{h} -Sets.},
year = {2016},
journal = {Combinatorics, Probability & Computing},
author = {{Domingos Dellamonica Jr.} and {Yoshiharu Kohayakawa} and {Sangjune Lee} and {Vojtech Rödl} and {Wojciech Samotij}}
}
@article{journals/dm/BhatR16,
title = {A short proof of the induced Ramsey Theorem for hypergraphs.},
year = {2016},
journal = {Discrete Mathematics},
author = {{Vindya Bhat} and {Vojtech Rödl}}
}
@article{journals/ejc/FranklKR16,
title = {A note on supersaturated set systems.},
year = {2016},
journal = {Eur. J. Comb.},
author = {{Peter Frankl} and {Yoshiharu Kohayakawa} and {Vojtech Rödl}}
}
@article{journals/jct/DellamonicaKLRS16,
title = {The number of B_{3}-sets of a given cardinality.},
year = {2016},
journal = {J. Comb. Theory, Ser. A},
author = {{Domingos Dellamonica Jr.} and {Yoshiharu Kohayakawa} and {Sangjune Lee} and {Vojtech Rödl} and {Wojciech Samotij}}
}
@article{journals/jct/MessutiRS16,
title = {Packing minor-closed families of graphs into complete graphs.},
year = {2016},
journal = {J. Comb. Theory, Ser. B},
author = {{Silvia Messuti} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/jct/ReiherRS16,
title = {Embedding tetrahedra into quasirandom hypergraphs.},
year = {2016},
journal = {J. Comb. Theory, Ser. B},
author = {{Christian Reiher} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/rsa/DellamonicaFR16,
title = {On induced Ramsey numbers for *k*-uniform hypergraphs.},
year = {2016},
journal = {Random Struct. Algorithms},
author = {{Domingos Dellamonica Jr.} and {Steve La Fleur} and {Vojtech Rödl}}
}
@article{journals/rsa/HornKR16,
title = {Isomorphic edge disjoint subgraphs of hypergraphs.},
year = {2016},
journal = {Random Struct. Algorithms},
author = {{Paul Horn} and {Václav Koubek} and {Vojtech Rödl}}
}
@article{journals/combinatorica/RodlRS17,
title = {An exponential-type upper bound for Folkman numbers.},
year = {2017},
journal = {Combinatorica},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001} and {Mathias Schacht}}
}
@article{journals/combinatorics/ArmanR17,
title = {Note on a Ramsey Theorem for Posets with Linear Extensions.},
year = {2017},
journal = {Electr. J. Comb.},
author = {{Andrii Arman} and {Vojtech Rödl}}
}
@article{journals/dmgt/Rodl0S17,
title = {Ramsey properties of random graphs and Folkman numbers.},
year = {2017},
journal = {Discussiones Mathematicae Graph Theory},
author = {{Vojtech Rödl} and {Andrzej Rucinski 0001} and {Mathias Schacht}}
}
@article{journals/jct/AvartKRR17,
title = {The chromatic number of finite type-graphs.},
year = {2017},
journal = {J. Comb. Theory, Ser. B},
author = {{Christian Avart} and {Bill Kay} and {Christian Reiher} and {Vojtech Rödl}}
}
@article{journals/jgt/DudekFMR17,
title = {On the Size-Ramsey Number of Hypergraphs.},
year = {2017},
journal = {Journal of Graph Theory},
author = {{Andrzej Dudek} and {Steve La Fleur} and {Dhruv Mubayi} and {Vojtech Rödl}}
}
@article{journals/cpc/DuffusKR18,
title = {The Minimum Number of Edges in Uniform Hypergraphs with Property O.},
year = {2018},
journal = {Combinatorics, Probability & Computing},
author = {{Dwight Duffus} and {Bill Kay} and {Vojtech Rödl}}
}
@article{journals/jct/BhatNRR18,
title = {A Ramsey class for Steiner systems.},
year = {2018},
journal = {J. Comb. Theory, Ser. A},
author = {{Vindya Bhat} and {Jaroslav Nesetril} and {Christian Reiher} and {Vojtech Rödl}}
}
@article{journals/jlms/ReiherRS18,
title = {Hypergraphs with vanishing Turán density in uniformly dense hypergraphs.},
year = {2018},
journal = {J. London Math. Society},
author = {{Christian Reiher} and {Vojtech Rödl} and {Mathias Schacht}}
}
@article{journals/order/NesetrilR18,
title = {Ramsey Partial Orders from Acyclic Graphs.},
year = {2018},
journal = {Order},
author = {{Jaroslav Nesetril} and {Vojtech Rödl}}
}
@article{journals/siamdm/HanRS18,
title = {Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.},
year = {2018},
journal = {SIAM J. Discrete Math.},
author = {{Hiêp Hàn} and {Vojtech Rödl} and {Tibor Szabó}}
}
@article{journals/siamdm/KohayakawaLMR18,
title = {Infinite Sidon Sets Contained in Sparse Random Sets of Integers.},
year = {2018},
journal = {SIAM J. Discrete Math.},
author = {{Yoshiharu Kohayakawa} and {Sangjune Lee} and {Carlos Gustavo Moreira} and {Vojtech Rödl}}
}
@article{journals/rsa/KohayakawaRR19,
title = {The size Ramsey number of short subdivisions of bounded degree graphs.},
year = {2019},
journal = {Random Struct. Algorithms},
author = {{Yoshiharu Kohayakawa} and {Troy Retter} and {Vojtech Rödl}}
}