Vojtech Rödl

316 papers A* 14B 6C 1Journal 288Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Colorings of k-sets with low discrepancy on small sets.
J. Comb. Theory B
Pavel Pudlák, Vojtech Rödl
2025 J jnl
On Set Representation of Bounded Degree Hypergaphs.
Electron. J. Comb.
Ayush Basu, Griffin Johnston, Vojtech Rödl, Marcelo Tadeu Sales
2025 J jnl
The number of cliques in hypergraphs with forbidden subgraphs.
Discret. Math.
Ayush Basu, Vojtech Rödl, Yi Zhao
2024 J jnl
A note on the induced Ramsey theorem for spaces.
Comb. Theory
Bryce Frederickson, Vojtech Rödl, Marcelo Tadeu Sales
2024 J jnl
Equivalent regular partitions of three-uniform hypergraphs.
Random Struct. Algorithms
Brendan Nagle, Vojtech Rödl, Mathias Schacht
2024 J jnl
On Pisier Type Theorems.
Comb.
Jaroslav Nesetril, Vojtech Rödl, Marcelo Tadeu Sales
2024 J jnl
On the Ramsey numbers of daisies I.
Comb. Probab. Comput.
Pavel Pudlák, Vojtech Rödl, Marcelo Tadeu Sales
2024 J jnl
Some results and problems on clique coverings of hypergraphs.
J. Graph Theory
Vojtech Rödl, Marcelo Tadeu Sales
2023 J jnl
Colorful Matchings.
SIAM J. Discret. Math.
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
2023 J jnl
Independence number of hypergraphs under degree conditions.
Random Struct. Algorithms
Vojtech Rödl, Marcelo Tadeu Sales, Yi Zhao
2022 J jnl
A blurred view of Van der Waerden type theorems.
Comb. Probab. Comput.
Vojtech Rödl, Marcelo Tadeu Sales
2022 J jnl
Covering the edges of a random hypergraph by cliques.
Discuss. Math. Graph Theory
Vojtech Rödl, Andrzej Rucinski
2022 J jnl
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree.
Electron. J. Comb.
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
2022 J jnl
Extractors for Small Zero-Fixing Sources.
Comb.
Pavel Pudlák, Vojtech Rödl
2022 J jnl
Independent Sets in Subgraphs of a Shift Graph.
Electron. J. Comb.
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
2021 J jnl
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm.
CoRR
Michal Koucký, Vojtech Rödl, Navid Talebanfard
2021 J jnl
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm.
Log. Methods Comput. Sci.
Michal Koucký, Vojtech Rödl, Navid Talebanfard
2021 J jnl
Every Steiner triple system contains almost spanning d-ary hypertree.
CoRR
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
2021 J jnl
Increasing paths in countable graphs.
J. Comb. Theory A
Andrii Arman, Bradley Elliott, Vojtech Rödl
2021 J jnl
On Hamiltonian cycles in hypergraphs with dense link graphs.
J. Comb. Theory B
Joanna Polcyn, Christian Reiher, Vojtech Rödl, Bjarne Schülke
2021 J jnl
On local Turán problems.
J. Comb. Theory A
Peter Frankl, Hao Huang, Vojtech Rödl
2021 J jnl
On strong Sidon sets of integers.
J. Comb. Theory A
Yoshiharu Kohayakawa, Sang June Lee, Carlos Gustavo Moreira, Vojtech Rödl
2021 J jnl
Ramsey-type numbers involving graphs and hypergraphs with large girth.
Comb. Probab. Comput.
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
2021 C conf
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links.
LAGOS
Sören Berger, Simón Piga, Christian Reiher, Vojtech Rödl, Mathias Schacht
2019 J jnl
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm.
Electron. Colloquium Comput. Complex.
Michal Koucký, Vojtech Rödl, Navid Talebanfard
2019 J jnl
A note on weak delta systems.
Discret. Math.
Andrii Arman, Bill Kay, Vojtech Rödl
2019 J jnl
Extractors for small zero-fixing sources.
CoRR
Pavel Pudlák, Vojtech Rödl
2019 J jnl
Extractors for small zero-fixing sources.
Electron. Colloquium Comput. Complex.
Pavel Pudlák, Vojtech Rödl
2019 J jnl
Packing Paths in Steiner Triple Systems.
SIAM J. Discret. Math.
Domingos Dellamonica Jr., Vojtech Rödl
2019 J jnl
The size Ramsey number of short subdivisions of bounded degree graphs.
Random Struct. Algorithms
Yoshiharu Kohayakawa, Troy Retter, Vojtech Rödl
2018 J jnl
A Ramsey class for Steiner systems.
J. Comb. Theory A
Vindya Bhat, Jaroslav Nesetril, Christian Reiher, Vojtech Rödl
2018 J jnl
An algorithmic hypergraph regularity lemma.
Random Struct. Algorithms
Brendan Nagle, Vojtech Rödl, Mathias Schacht
2018 J jnl
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs.
J. Lond. Math. Soc.
Christian Reiher, Vojtech Rödl, Mathias Schacht
2018 J jnl
Infinite Sidon Sets Contained in Sparse Random Sets of Integers.
SIAM J. Discret. Math.
Yoshiharu Kohayakawa, Sangjune Lee, Carlos Gustavo Moreira, Vojtech Rödl
2018 J jnl
Ramsey Partial Orders from Acyclic Graphs.
Order
Jaroslav Nesetril, Vojtech Rödl
2018 J jnl
The Minimum Number of Edges in Uniform Hypergraphs with Property O.
Comb. Probab. Comput.
Dwight Duffus, Bill Kay, Vojtech Rödl
2018 J jnl
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.
SIAM J. Discret. Math.
Hiêp Hàn, Vojtech Rödl, Tibor Szabó
2017 J jnl
An exponential-type upper bound for Folkman numbers.
Comb.
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
2017 J jnl
Note on a Ramsey Theorem for Posets with Linear Extensions.
Electron. J. Comb.
Andrii Arman, Vojtech Rödl
2017 J jnl
On the Size-Ramsey Number of Hypergraphs.
J. Graph Theory
Andrzej Dudek, Steve La Fleur, Dhruv Mubayi, Vojtech Rödl
2017 J jnl
Ramsey properties of random graphs and Folkman numbers.
Discuss. Math. Graph Theory
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
2017 J jnl
The chromatic number of finite type-graphs.
J. Comb. Theory B
Christian Avart, Bill Kay, Christian Reiher, Vojtech Rödl
2017 J jnl
The complexity of proving that a graph is Ramsey.
Comb.
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2016 J jnl
A note on supersaturated set systems.
Eur. J. Comb.
Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl
2016 J jnl
A short proof of the induced Ramsey Theorem for hypergraphs.
Discret. Math.
Vindya Bhat, Vojtech Rödl
2016 A* conf
An Algorithmic Hypergraph Regularity Lemma.
SODA
Brendan Nagle, Vojtech Rödl, Mathias Schacht
2016 J jnl
Embedding tetrahedra into quasirandom hypergraphs.
J. Comb. Theory B
Christian Reiher, Vojtech Rödl, Mathias Schacht
2016 J jnl
Isomorphic edge disjoint subgraphs of hypergraphs.
Random Struct. Algorithms
Paul Horn, Václav Koubek, Vojtech Rödl
2016 J jnl
On induced Ramsey numbers for
Random Struct. Algorithms
Domingos Dellamonica Jr., Steve La Fleur, Vojtech Rödl
2016 J jnl
On the Number of
Comb. Probab. Comput.
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
2016 J jnl
Packing minor-closed families of graphs into complete graphs.
J. Comb. Theory B
Silvia Messuti, Vojtech Rödl, Mathias Schacht
2016 J jnl
The number of B
J. Comb. Theory A
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
2015 J jnl
An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.
Comb. Probab. Comput.
Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira
2015 J jnl
An improved upper bound on the density of universal random graphs.
Random Struct. Algorithms
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
2015 J jnl
Packing minor closed families of graphs.
Electron. Notes Discret. Math.
Silvia Messuti, Vojtech Rödl, Mathias Schacht
2015 J jnl
Ramsey-type numbers involving graphs and hypergraphs with large girth.
Electron. Notes Discret. Math.
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
2015 J jnl
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers.
Random Struct. Algorithms
Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
2014 J jnl
Degree Ramsey Numbers of Closed Blowups of Trees.
Electron. J. Comb.
Paul Horn, Kevin G. Milans, Vojtech Rödl
2014 J jnl
Families of triples with high minimum degree are Hamiltonian.
Discuss. Math. Graph Theory
Vojtech Rödl, Andrzej Rucinski
2014 J jnl
On generalized Ramsey numbers of Erdős and Rogers.
J. Comb. Theory B
Andrzej Dudek, Troy Retter, Vojtech Rödl
2013 — ch.
Arrangeability and Clique Subdivisions.
The Mathematics of Paul Erdős II
Vojtech Rödl, Robin Thomas
2013 J jnl
Jumps and Nonjumps in Multigraphs.
SIAM J. Discret. Math.
Paul Horn, Steve La Fleur, Vojtech Rödl
2013 J jnl
Maximal independent sets in the covering graph of the cube.
Discret. Appl. Math.
Dwight Duffus, Peter Frankl, Vojtech Rödl
2013 J jnl
Note on Upper Density of Quasi-Random Hypergraphs.
Electron. J. Comb.
Vindya Bhat, Vojtech Rödl
2013 J jnl
Note on the point character of
Period. Math. Hung.
Christian Avart, Péter Komjáth, Vojtech Rödl
2013 J jnl
Some recent results on Ramsey-type numbers.
Discret. Appl. Math.
Andrzej Dudek, Peter Frankl, Vojtech Rödl
2013 — conf
The Complexity of Proving That a Graph Is Ramsey.
ICALP (1)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2013 J jnl
The complexity of proving that a graph is Ramsey
CoRR
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2013 J jnl
The complexity of proving that a graph is Ramsey.
Electron. Colloquium Comput. Complex.
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2012 J jnl
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.
SIAM J. Discret. Math.
Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira
2012 B conf
An Improved Upper Bound on the Density of Universal Random Graphs.
LATIN
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
2012 J jnl
Complete Partite subgraphs in dense hypergraphs.
Random Struct. Algorithms
Vojtech Rödl, Mathias Schacht
2012 J jnl
Distance Preserving Ramsey Graphs.
Comb. Probab. Comput.
Domingos Dellamonica Jr., Vojtech Rödl
2012 J jnl
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.
J. Comb. Theory A
Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov
2012 J jnl
On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput.
Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte
2012 J jnl
On induced Folkman numbers.
Random Struct. Algorithms
Andrzej Dudek, Reshma Ramadurai, Vojtech Rödl
2012 J jnl
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.
Comb. Probab. Comput.
Peter Frankl, Vojtech Rödl, Andrzej Rucinski
2012 J jnl
Universality of Random Graphs.
SIAM J. Discret. Math.
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
2011 — conf
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.
APPROX-RANDOM
Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira
2011 J jnl
A note on Thomassenʼs conjecture.
J. Comb. Theory B
Domingos Dellamonica Jr., Vojtech Rödl
2011 J jnl
Hereditary quasirandom properties of hypergraphs.
Comb.
Domingos Dellamonica Jr., Vojtech Rödl
2011 J jnl
Maximal independent sets in bipartite graphs obtained from Boolean lattices.
Eur. J. Comb.
Dwight Duffus, Peter Frankl, Vojtech Rödl
2011 J jnl
On
Comb.
Andrzej Dudek, Vojtech Rödl
2011 J jnl
On a conjecture of Thomassen concerning subgraphs of large girth.
J. Graph Theory
Domingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl
2011 A* conf
The maximum size of a Sidon set contained in a sparse random set of integers.
SODA
Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl
2010 J jnl
An almost quadratic bound on vertex Folkman numbers.
J. Comb. Theory B
Andrzej Dudek, Vojtech Rödl
2010 J jnl
Constructions of sparse uniform hypergraphs with high chromatic number.
Random Struct. Algorithms
Alexandr V. Kostochka, Vojtech Rödl
2010 J jnl
Note on robust critical graphs with large odd girth.
Discret. Math.
Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers
2010 J jnl
On the number of graphs with a given endomorphism monoid.
Discret. Math.
Václav Koubek, Vojtech Rödl
2010 J jnl
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
SIAM J. Comput.
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
2010 J jnl
Ramsey properties of random discrete structures.
Random Struct. Algorithms
Ehud Friedgut, Vojtech Rödl, Mathias Schacht
2010 J jnl
Some constructive bounds on Ramsey numbers.
J. Comb. Theory B
Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl
2010 J jnl
Weak hypergraph regularity and linear hypergraphs.
J. Comb. Theory B
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht
2009 J jnl
A Note on Universal and Canonically Coloured Sequences.
Comb. Probab. Comput.
Andrzej Dudek, Peter Frankl, Vojtech Rödl
2009 J jnl
Generalizations of the removal lemma.
Comb.
Vojtech Rödl, Mathias Schacht
2009 J jnl
Hereditary quasi-random properties of hypergraphs.
Electron. Notes Discret. Math.
Domingos Dellamonica Jr., Vojtech Rödl
2009 A* conf
Hypergraph regularity and quasi-randomness.
SODA
Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht
2009 J jnl
On Colourings of Hypergraphs Without Monochromatic Fano Planes.
Comb. Probab. Comput.
Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht
2009 J jnl
On graphs with a given endomorphism monoid.
J. Graph Theory
Václav Koubek, Vojtech Rödl, Benjamin Shemmer
2009 J jnl
On k-chromatically connected graphs.
Discret. Math.
Andrzej Dudek, Esmeralda Nastase, Vojtech Rödl
2009 J jnl
Perfect matchings in large uniform hypergraphs with large minimum collective degree.
J. Comb. Theory A
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2009 J jnl
Representing Subdirect Product Monoids by Graphs.
Int. J. Algebra Comput.
Václav Koubek, Vojtech Rödl, Benjamin Shemmer
2009 J jnl
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Comb. Probab. Comput.
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan
2008 J jnl
An Algorithmic Version of the Hypergraph Regularity Method.
SIAM J. Comput.
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
2008 J jnl
An approximate Dirac-type theorem for
Comb.
Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski
2008 J jnl
Colorful Flowers.
Electron. Notes Discret. Math.
Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl
2008 J jnl
Finding Folkman Numbers via MAX CUT Problem.
Electron. Notes Discret. Math.
Andrzej Dudek, Vojtech Rödl
2008 J jnl
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness.
Internet Math.
Jan Zich, Yoshiharu Kohayakawa, Vojtech Rödl, V. Sunderam
2008 B conf
New Upper Bound on Vertex Folkman Numbers.
LATIN
Andrzej Dudek, Vojtech Rödl
2008 J jnl
Note on the 3-graph counting lemma.
Discret. Math.
Brendan Nagle, Vojtech Rödl, Mathias Schacht
2008 J jnl
On Ramsey Minimal Graphs.
SIAM J. Discret. Math.
Vojtech Rödl, Mark H. Siggers
2008 J jnl
On the Folkman Number
Exp. Math.
Andrzej Dudek, Vojtech Rödl
2008 J jnl
On the Ramsey Number of Sparse 3-Graphs.
Graphs Comb.
Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht
2008 J jnl
On the Turán Properties of Infinite Graphs.
Electron. J. Comb.
Andrzej Dudek, Vojtech Rödl
2008 J jnl
Triangulations and the Hajós conjecture.
J. Graph Theory
Vojtech Rödl, Jan Zich
2008 A* conf
Universality of random graphs.
SODA
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
2007 J jnl
A note on the jumping constant conjecture of Erdös.
J. Comb. Theory B
Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot
2007 J jnl
Every Monotone 3-Graph Property is Testable.
SIAM J. Discret. Math.
Christian Avart, Vojtech Rödl, Mathias Schacht
2007 J jnl
Integer and fractional packings of hypergraphs.
J. Comb. Theory B
Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige
2007 J jnl
On the chromatic number and independence number of hypergraph products.
J. Comb. Theory B
Dhruv Mubayi, Vojtech Rödl
2007 A* conf
Property testing in hypergraphs and the removal lemma.
STOC
Vojtech Rödl, Mathias Schacht
2007 A* conf
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
ICALP
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
2007 J jnl
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.
SIAM J. Discret. Math.
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
2007 J jnl
Regular Partitions of Hypergraphs: Counting Lemmas.
Comb. Probab. Comput.
Vojtech Rödl, Mathias Schacht
2007 J jnl
Regular Partitions of Hypergraphs: Regularity Lemmas.
Comb. Probab. Comput.
Vojtech Rödl, Mathias Schacht
2007 J jnl
Small subsets inherit sparse epsilon-regularity.
J. Comb. Theory B
Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger
2007 J jnl
Turán's theorem for pseudo-random graphs.
J. Comb. Theory A
Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan
2006 J jnl
A Dirac-Type Theorem for 3-Uniform Hypergraphs.
Comb. Probab. Comput.
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2006 J jnl
A note on a conjecture by Füredi.
J. Comb. Theory A
Vojtech Rödl, Eduardo Tengan
2006 — book
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring.
Ehud Friedgut, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
2006 J jnl
Applications of the regularity lemma for uniform hypergraphs.
Random Struct. Algorithms
Vojtech Rödl, Jozef Skokan
2006 J jnl
Color critical hypergraphs with many edges.
J. Graph Theory
Vojtech Rödl, Mark H. Siggers
2006 J jnl
Measures of Pseudorandomness for Finite Sequences: Minimal Values.
Comb. Probab. Comput.
Noga Alon, Yoshiharu Kohayakawa, Christian Mauduit, Carlos Gustavo T. de A. Moreira, Vojtech Rödl
2006 J jnl
On Ramsey numbers of uniform hypergraphs with given maximum degree.
J. Comb. Theory A
Alexandr V. Kostochka, Vojtech Rödl
2006 J jnl
Perfect matchings in uniform hypergraphs with large minimum degree.
Eur. J. Comb.
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2006 J jnl
Short paths in quasi-random triple systems with sparse underlying graphs.
J. Comb. Theory B
Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2006 J jnl
Supersaturation For Ramsey-Turán Problems.
Comb.
Dhruv Mubayi, Vojtech Rödl
2006 J jnl
The Ramsey number for hypergraph cycles I.
J. Comb. Theory A
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan
2006 J jnl
The counting lemma for regular
Random Struct. Algorithms
Brendan Nagle, Vojtech Rödl, Mathias Schacht
2005 A* conf
An Algorithmic Version of the Hypergraph Regularity Method.
FOCS
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
2005 J jnl
Counting Small Cliques in 3-uniform Hypergraphs.
Comb. Probab. Comput.
Yuejian Peng, Vojtech Rödl, Jozef Skokan
2005 J jnl
Counting subgraphs in quasi-random 4-uniform hypergraphs.
Random Struct. Algorithms
Vojtech Rödl, Jozef Skokan
2005 J jnl
Distance Graphs on the Integers.
Comb. Probab. Comput.
Mike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl
2005 J jnl
Every Monotone 3-Graph Property is Testable.
Electron. Notes Discret. Math.
Christian Avart, Vojtech Rödl, Mathias Schacht
2005 J jnl
On Cover Graphs and Dependent Arcs in Acyclic Orientations.
Comb. Probab. Comput.
Vojtech Rödl, Lubos Thoma
2005 J jnl
Sharp Bounds For Some Multicolor Ramsey Numbers.
Comb.
Noga Alon, Vojtech Rödl
2005 B conf
The Generalization of Dirac's Theorem for Hypergraphs.
MFCS
Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl
2004 J jnl
On Graphs With Small Ramsey Numbers, II.
Comb.
Alexandr V. Kostochka, Vojtech Rödl
2004 J jnl
Regularity Lemma for k-uniform hypergraphs.
Random Struct. Algorithms
Vojtech Rödl, Jozef Skokan
2004 J jnl
The Turán Theorem for Random Graphs.
Comb. Probab. Comput.
Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht
2004 J jnl
Uniform Edge Distribution in Hypergraphs is Hereditary.
Electron. J. Comb.
Dhruv Mubayi, Vojtech Rödl
2003 J jnl
An Optimal Algorithm for Checking Regularity.
SIAM J. Comput.
Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma
2003 J jnl
Hereditary Properties Of Triple Systems.
Comb. Probab. Comput.
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl
2003 J jnl
Independent Deuber sets in graphs on the natural numbers.
J. Comb. Theory A
David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl
2003 J jnl
Integer and fractional packings in dense 3-uniform hypergraphs.
Random Struct. Algorithms
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
2003 J jnl
On homogeneous sets of positive integers.
J. Comb. Theory A
Vojtech Rödl
2003 J jnl
On large intersecting subfamilies of uniform setfamilies.
Random Struct. Algorithms
Richard A. Duke, Paul Erdös, Vojtech Rödl
2003 J jnl
Ramsey Games Against a One-Armed Bandit.
Comb. Probab. Comput.
Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
2003 J jnl
Regular pairs in sparse random graphs I.
Random Struct. Algorithms
Yoshiharu Kohayakawa, Vojtech Rödl
2003 J jnl
Regularity properties for triple systems.
Random Struct. Algorithms
Brendan Nagle, Vojtech Rödl
2002 A* conf
An optimal algorithm for checking regularity (extended abstract).
SODA
Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma
2002 A* conf
Efficient Testing of Hypergraphs.
ICALP
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl
2002 J jnl
Extremal problems on set systems.
Random Struct. Algorithms
Peter Frankl, Vojtech Rödl
2002 J jnl
Holes in Graphs.
Electron. J. Comb.
Yuejian Peng, Vojtech Rödl, Andrzej Rucinski
2002 J jnl
Hypergraphs, Quasi-randomness, and Conditions for Regularity.
J. Comb. Theory A
Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
2002 J jnl
On characterizing hypergraph regularity.
Random Struct. Algorithms
Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl
2002 J jnl
On the Turán Number of Triple Systems.
J. Comb. Theory A
Dhruv Mubayi, Vojtech Rödl
2002 J jnl
Ramsey Properties of Families of Graphs.
J. Comb. Theory B
Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
2001 J jnl
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers.
J. Comb. Theory A
David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl
2001 J jnl
Integer and Fractional Packings in Dense Graphs.
Comb.
Penny E. Haxell, Vojtech Rödl
2001 J jnl
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma.
SIAM J. Comput.
Vojtech Rödl, Andrzej Rucinski, Michelle Wagner
2001 — conf
Near-optimum Universal Graphs for Graphs with Bounded Degrees.
RANDOM-APPROX
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2001 J jnl
On Bipartite Graphs with Linear Ramsey Numbers.
Comb.
Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski
2001 J jnl
On graphs with small Ramsey numbers.
J. Graph Theory
Alexandr V. Kostochka, Vojtech Rödl
2001 J jnl
On the chromatic number of set systems.
Random Struct. Algorithms
Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali
2001 J jnl
The asymptotic number of triple systems not containing a fixed one.
Discret. Math.
Brendan Nagle, Vojtech Rödl
2000 B conf
Algorithmic Aspects of Regularity.
LATIN
Yoshiharu Kohayakawa, Vojtech Rödl
2000 J jnl
An Algorithmic Regularity Lemma for Hypergraphs.
SIAM J. Comput.
Andrzej Czygrinow, Vojtech Rödl
2000 B conf
Equivalent Conditions for Regularity (Extended Abstract).
LATIN
Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
2000 J jnl
On Size Ramsey Numbers of Graphs with Bounded Degree.
Comb.
Vojtech Rödl, Endre Szemerédi
2000 J jnl
On graphs with linear Ramsey numbers.
J. Graph Theory
Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski
2000 A* conf
Universality and Tolerance.
FOCS
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
1999 J jnl
Constructive Quasi-Ramsey Numbers and Tournament Ranking.
SIAM J. Discret. Math.
Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl
1999 J jnl
Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs.
J. Comb. Theory A
David S. Gunderson, Vojtech Rödl, Alexander F. Sidorenko
1999 J jnl
Hypergraph Packing And Graph Embedding.
Comb. Probab. Comput.
Vojtech Rödl, Andrzej Rucinski, Anusch Taraz
1999 J jnl
Non-Ramsey Graphs Are c log n-Universal.
J. Comb. Theory A
Hans Jürgen Prömel, Vojtech Rödl
1999 J jnl
Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma.
Comb.
Vojtech Rödl, Andrzej Rucinski
1998 — conf
An Algorithmic Embedding of Graphs via Perfect Matchings.
RANDOM
Vojtech Rödl, Andrzej Rucinski, Michelle Wagner
1998 J jnl
Endomorphisms of Partially Ordered Sets.
Comb. Probab. Comput.
Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
1998 J jnl
Extremal Problems for Affine Cubes of Integers.
Comb. Probab. Comput.
David S. Gunderson, Vojtech Rödl
1998 J jnl
Independent finite sums in graphs defined on the natural numbers.
Discret. Math.
Tomasz Luczak, Vojtech Rödl, Tomasz Schoen
1998 J jnl
Induced Ramsey Numbers.
Comb.
Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl
1998 J jnl
On Large Systems of Sets with No Large Weak <Delta>-subsystems.
Comb.
Alexandr V. Kostochka, Vojtech Rödl
1998 J jnl
Partial Steiner systems and matchings in hypergraphs.
Random Struct. Algorithms
Alexandr V. Kostochka, Vojtech Rödl
1998 J jnl
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.
Comb. Probab. Comput.
Tomasz Luczak, Vojtech Rödl, Endre Szemerédi
1998 J jnl
Perfect Matchings in ε-regular Graphs.
Electron. J. Comb.
Noga Alon, Vojtech Rödl, Andrzej Rucinski
1998 J jnl
Ramsey Properties of Random Hypergraphs.
J. Comb. Theory A
Vojtech Rödl, Andrzej Rucinski
1997 J jnl
Bipartite Coverings of Graphs.
Comb. Probab. Comput.
Vojtech Rödl, Andrzej Rucinski
1997 J jnl
Boolean Circuits, Tensor Ranks, and Communication Complexity.
SIAM J. Comput.
Pavel Pudlák, Vojtech Rödl, Jirí Sgall
1997 J jnl
Chromatic Ramsey Theory.
Eur. J. Comb.
Norbert Sauer, Robert E. Woodrow, Vojtech Rödl
1997 J jnl
Note on regular subgraphs.
J. Graph Theory
Vojtech Rödl, Beata Wysocka
1997 J jnl
On
Comb.
Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl
1997 J jnl
On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems.
J. Comb. Theory A
Vojtech Rödl, Lubos Thoma
1996 J jnl
Applications of hypergraph coloring to coloring graphs not inducing certain trees.
Discret. Math.
Hal A. Kierstead, Vojtech Rödl
1996 J jnl
Asymptotic packing and the random greedy algorithm.
Random Struct. Algorithms
Vojtech Rödl, Lubos Thoma
1996 J jnl
Graphs of Small Dimensions.
Comb.
Nancy Eaton, Vojtech Rödl
1996 J jnl
Multicolored Subsets in Colored Hypergraphs.
J. Comb. Theory A
Hanno Lefmann, Vojtech Rödl, Beata Wysocka
1996 J jnl
On
J. Graph Theory
Nancy Eaton, Ronald J. Gould, Vojtech Rödl
1996 J jnl
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree.
J. Comb. Theory B
Tomasz Luczak, Vojtech Rödl
1996 — conf
Proper Bounded Edge-Colorings.
DMTCS
Claudia Bertram-Kretzberg, Hanno Lefmann, Vojtech Rödl, Beata Wysocka
1996 J jnl
Ramsey-type results for oriented trees.
J. Graph Theory
Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl
1995 J jnl
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.
SIAM J. Comput.
Richard A. Duke, Hanno Lefmann, Vojtech Rödl
1995 J jnl
Covering of r-Graphs by Complete r-Partite Subgraphs.
Random Struct. Algorithms
Paul Erdös, Vojtech Rödl
1995 J jnl
Dense Graphs without 3-Regular Subgraphs.
J. Comb. Theory B
László Pyber, Vojtech Rödl, Endre Szemerédi
1995 J jnl
On Erdös-Rado Numbers.
Comb.
Hanno Lefmann, Vojtech Rödl
1995 J jnl
On Ramsey Sets in Spheres.
J. Comb. Theory A
Jirí Matousek, Vojtech Rödl
1995 J jnl
On Uncrowded Hypergraphs.
Random Struct. Algorithms
Richard A. Duke, Hanno Lefmann, Vojtech Rödl
1995 J jnl
On the Computational Complexity of Ordered Subgraph Recognition.
Random Struct. Algorithms
Dwight Duffus, Mark Ginn, Vojtech Rödl
1995 J jnl
On the Genus of a Random Graph.
Random Struct. Algorithms
Vojtech Rödl, Robin Thomas
1995 J jnl
On the Jumping Constant Conjecture for Multigraphs.
J. Comb. Theory A
Vojtech Rödl, Alexander F. Sidorenko
1995 J jnl
Ramsey Families which Exclude a Graph.
Comb.
Vojtech Rödl, Norbert Sauer, Xuding Zhu
1995 J jnl
Shift graphs and lower bounds on Ramsey numbers r
Discret. Math.
Dwight Duffus, Hanno Lefmann, Vojtech Rödl
1995 J jnl
The Minimum Independence Number for Designs.
Comb.
David A. Grable, Kevin T. Phelps, Vojtech Rödl
1994 J jnl
Note on Independent Sets in Steiner Systems.
Random Struct. Algorithms
Vojtech Rödl, Edita Sinajová
1994 J jnl
Random Graphs with Monochromatic Triangles in Every Edge Coloring.
Random Struct. Algorithms
Vojtech Rödl, Andrzej Rucinski
1994 J jnl
Some combinatorial-algebraic problems from complexity theory.
Discret. Math.
Pavel Pudlák, Vojtech Rödl
1994 J jnl
The Algorithmic Aspects of the Regularity Lemma.
J. Algorithms
Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
1994 J jnl
The Erdös-Ko-Rado Theorem for Small Families.
J. Comb. Theory A
Richard A. Duke, Vojtech Rödl
1994 J jnl
Unbalanced Steiner Triple Systems.
J. Comb. Theory A
Lucien Haddad, Vojtech Rödl
1993 J jnl
2-Colorings of complete graphs with a small number of monochromatic K
Discret. Math.
Frantisek Franek, Vojtech Rödl
1993 J jnl
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.
J. Comb. Theory B
David S. Gunderson, Vojtech Rödl, Norbert W. Sauer
1993 A* conf
Modified ranks of tensors and the size of circuits.
STOC
Pavel Pudlák, Vojtech Rödl
1993 J jnl
Monochromatic Trees with Respect to Edge Partitions.
J. Comb. Theory B
Vojtech Rödl, Bernd Voigt
1993 J jnl
On Canonical Ramsey Numbers for Complete Graphs versus Paths.
J. Comb. Theory B
Hanno Lefmann, Vojtech Rödl
1993 J jnl
On isomorphic subgraphs.
Discret. Math.
Ronald J. Gould, Vojtech Rödl
1993 J jnl
Rigid Linear Binary Codes.
J. Comb. Theory A
Hanno Lefmann, Kevin T. Phelps, Vojtech Rödl
1992 J jnl
A Canonical Ramsey Theorem.
Random Struct. Algorithms
Nancy Eaton, Vojtech Rödl
1992 J jnl
A combinatorial approach to complexity.
Comb.
Pavel Pudlák, Vojtech Rödl
1992 J jnl
Cycle-connected graphs.
Discret. Math.
Richard A. Duke, Paul Erdös, Vojtech Rödl
1992 J jnl
Monochromatic Vs multicolored paths.
Graphs Comb.
Hanno Lefmann, Vojtech Rödl, Robin Thomas
1992 J jnl
On Ramsey graphs without bipartite subgraphs.
Discret. Math.
Jaroslav Nesetril, Vojtech Rödl
1992 J jnl
On coverings of infinite- dimentional metric spaces.
Discret. Math.
Jan Pelant, Vojtech Rödl
1992 J jnl
On embedding of graphs into euclidean spaces of small dimension.
J. Comb. Theory B
Jan Reiterman, Vojtech Rödl, Edita Sinajová
1992 J jnl
Rainbow Subgraphs in Properly Edge-colored Graphs.
Random Struct. Algorithms
Vojtech Rödl, Zsolt Tuza
1992 J jnl
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs.
Graphs Comb.
Frantisek Franek, Vojtech Rödl
1992 A* conf
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)
FOCS
Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster
1992 J jnl
The Uniformity Lemma for hypergraphs.
Graphs Comb.
Peter Frankl, Vojtech Rödl
1991 J jnl
A ramsey type problem concerning vertex colourings.
J. Comb. Theory B
Jason I. Brown, Vojtech Rödl
1991 J jnl
The number of t-wise balance designs.
Comb.
Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler
1990 J jnl
Iterated combinatorial density theorems.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1990 J jnl
Lower Bounds to the Complexity of Symmetric Boolean Functions.
Theor. Comput. Sci.
László Babai, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi
1990 J jnl
On ramsey families of sets.
Graphs Comb.
Vojtech Rödl
1990 J jnl
On the dimension to represent a graph by a unit distance graph.
Graphs Comb.
Hiroshi Maehara, Vojtech Rödl
1989 J jnl
A Ramsey-Type Theorem for Orderings of a Graph.
SIAM J. Discret. Math.
Vojtech Rödl, Peter Winkler
1989 J jnl
Chromatically optimal rigid graphs.
J. Comb. Theory B
Jaroslav Nesetril, Vojtech Rödl
1989 J jnl
Embeddings of Graphs in Euclidean Spaces.
Discret. Comput. Geom.
Jan Reiterman, Vojtech Rödl, Edita Sinajová
1989 J jnl
Geometrical embeddings of graphs.
Discret. Math.
Jan Reiterman, Vojtech Rödl, Edita Sinajová
1989 J jnl
Percentages in pairwise balanced designs.
Discret. Math.
Charles J. Colbourn, Vojtech Rödl
1989 J jnl
The partite construction and ramsey set systems.
Discret. Math.
Jaroslav Nesetril, Vojtech Rödl
1988 J jnl
Embedding of trees in euclidean spaces.
Graphs Comb.
Hiroshi Maehara, Jan Reiterman, Vojtech Rödl, Edita Sinajová
1988 J jnl
Graph Complexity.
Acta Informatica
Pavel Pudlák, Vojtech Rödl, Petr Savický
1988 J jnl
Quantitative theorems for regular systems of equations.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1988 J jnl
Some Ramsey - Turán type results for hypergraphs.
Comb.
Peter Frankl, Vojtech Rödl
1988 J jnl
The number of submatrices of a given type in a Hadamard matrix and related results.
J. Comb. Theory B
Peter Frankl, Vojtech Rödl, Richard M. Wilson
1988 J jnl
Tournament Ranking with Expected Profit in Polynomial Time.
SIAM J. Discret. Math.
Svatopluk Poljak, Vojtech Rödl, Joel Spencer
1987 J jnl
A note on ranking functions.
Discret. Math.
Vojtech Rödl, William T. Trotter
1987 J jnl
Induced restricted Ramsey theorems for spaces.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1987 J jnl
Local
J. Comb. Theory B
András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
1987 J jnl
Multiple Optima in Local Search.
J. Algorithms
Vojtech Rödl, Craig A. Tovey
1987 J jnl
On subsets of abelian groups with no 3-term arithmetic progression.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1987 J jnl
Small Spaces with Large Point Character.
Eur. J. Comb.
Vojtech Rödl
1986 J jnl
An elementary proof of the canonizing version of Gallai-Witt's theorem.
J. Comb. Theory A
Hans Jürgen Prömel, Vojtech Rödl
1986 J jnl
Coloring graphs with locally few colors.
Discret. Math.
Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress
1986 J jnl
Coloring of universal graphs.
Graphs Comb.
Péter Komjáth, Vojtech Rödl
1986 J jnl
Finite union theorem with restrictions.
Graphs Comb.
Jaroslav Nesetril, Vojtech Rödl
1986 J jnl
Large triangle-free subgraphs in graphs without
Graphs Comb.
Peter Frankl, Vojtech Rödl
1986 J jnl
Note on decomposition of spheres in Hilbert spaces.
J. Comb. Theory A
David Preiss, Vojtech Rödl
1986 J jnl
On sets of integers with the Schur property.
Graphs Comb.
Jaroslav Nesetril, Vojtech Rödl
1986 J jnl
On universality of graphs with uniformly distributed edges.
Discret. Math.
Vojtech Rödl
1986 J jnl
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent.
Graphs Comb.
Paul Erdös, Peter Frankl, Vojtech Rödl
1986 A* conf
Two lower bounds for branching programs
STOC
Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán
1985 J jnl
Canonizing Ordering Theorems for Hales Jewett Structures.
J. Comb. Theory A
Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt
1985 A* conf
Geometrical Realization of Set Systems and Probabilistic Communication Complexity
FOCS
Noga Alon, Peter Frankl, Vojtech Rödl
1985 J jnl
Lower bounds for Turán's problem.
Graphs Comb.
Peter Frankl, Vojtech Rödl
1985 J jnl
Near Perfect Coverings in Graphs and Hypergraphs.
Eur. J. Comb.
Peter Frankl, Vojtech Rödl
1985 J jnl
Note on a Ramsey-Turán type problem.
Graphs Comb.
Vojtech Rödl
1985 J jnl
On a Packing and Covering Problem.
Eur. J. Comb.
Vojtech Rödl
1985 J jnl
On color critical graphs.
J. Comb. Theory B
Vojtech Rödl, Zsolt Tuza
1985 J jnl
On graphs with small subgraphs of large chromatic number.
Graphs Comb.
Vojtech Rödl, Richard A. Duke
1985 J jnl
On the use of senders in generalized ramsey theory for graphs.
Discret. Math.
Stefan A. Burr, Jaroslav Nesetril, Vojtech Rödl
1985 J jnl
Threshold hypergraphs.
Discret. Math.
Jan Reiterman, Vojtech Rödl, Edita Sinajová, Miroslav Tuma
1985 J jnl
Two remarks on Ramsey's theorem.
Discret. Math.
Jaroslav Nesetril, Vojtech Rödl
1984 J jnl
Hypergraphs do not jump.
Comb.
Peter Frankl, Vojtech Rödl
1984 J jnl
On combinatorial properties of spheres in eulidean spaces.
Comb.
Vojtech Rödl
1984 J jnl
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems.
Comb.
Kevin T. Phelps, Vojtech Rödl
1984 J jnl
On the minimum order of graphs with given semigroup.
J. Comb. Theory B
Václav Koubek, Vojtech Rödl
1984 J jnl
Sparse Ramsey graphs.
Comb.
Jaroslav Nesetril, Vojtech Rödl
1983 J jnl
Another Proof of the Folkman-Rado-Sanders Theorem.
J. Comb. Theory A
Jaroslav Nesetril, Vojtech Rödl
1983 J jnl
On a problem in combinatorial geometry.
Discret. Math.
Vojtech Rödl
1983 J jnl
On a product dimension of bipartite graphs.
J. Graph Theory
Svatopluk Poljak, Vojtech Rödl, Ales Pultr
1983 J jnl
On qualitatively independent partitions and related problems.
Discret. Appl. Math.
Svatopluk Poljak, Ales Pultr, Vojtech Rödl
1983 J jnl
Ramsey Classes of Set Systems.
J. Comb. Theory A
Jaroslav Nesetril, Vojtech Rödl
1983 J jnl
The Ramsey number of a graph with bounded maximum degree.
J. Comb. Theory B
C. Chvatál, Vojtech Rödl, Endre Szemerédi, William T. Trotter
1982 J jnl
Colouring steiner quadruple systems.
Discret. Appl. Math.
Charles J. Colbourn, Marlene J. Colbourn, Kevin T. Phelps, Vojtech Rödl
1982 J jnl
Monotone paths in ordered graphs.
Comb.
Vladimír Müller, Vojtech Rödl
1982 J jnl
Nearly bipartite graphs with large chromatic number.
Comb.
Vojtech Rödl
1982 J jnl
Partition theorems for systems of finite subsets of integers.
Discret. Math.
Pavel Pudlák, Vojtech Rödl
1982 J jnl
Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs.
Eur. J. Comb.
Jaroslav Nesetril, Vojtech Rödl
1981 J jnl
Complexity of representation of graphs by set systems.
Discret. Appl. Math.
Svatopluk Poljak, Vojtech Rödl, Daniel Turzík
1981 B conf
Fast Recognition of Rings and Lattices.
FCT
Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl
1981 J jnl
On set systems determined by intersections.
Discret. Math.
Svatopluk Poljak, Vojtech Rödl
1981 J jnl
On the arc-chromatic number of a digraph.
J. Comb. Theory B
Svatopluk Poljak, Vojtech Rödl
1981 J jnl
Simple proof of the existence of restricted Ramsey graphs by means of a partite construction.
Comb.
Jaroslav Nesetril, Vojtech Rödl
1979 J jnl
A short proof of the existence of highly chromatic hypergraphs without short cycles.
J. Comb. Theory B
Jaroslav Nesetril, Vojtech Rödl
1978 J jnl
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph.
Discret. Math.
Jaroslav Nesetril, Vojtech Rödl
1977 J jnl
Partitions of Finite Relational and Set Systems.
J. Comb. Theory A
Jaroslav Nesetril, Vojtech Rödl