Vojtech Rödl

Publication Activity (10 Years)

Years Active: 1977-2023
Publications (10 Years): 44

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

J. Comb. Theory, Ser. B

Publications

Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
Colorful Matchings. SIAM J. Discret. Math. 37 (2) (2023)
Vojtech Rödl, Marcelo Tadeu Sales, Yi Zhao
Independence number of hypergraphs under degree conditions. Random Struct. Algorithms 63 (3) (2023)
Pavel Pudlák, Vojtech Rödl
Extractors for Small Zero-Fixing Sources. Comb. 42 (4) (2022)
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree. Electron. J. Comb. 29 (3) (2022)
Vojtech Rödl, Marcelo Tadeu Sales
A blurred view of Van der Waerden type theorems. Comb. Probab. Comput. 31 (4) (2022)
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
Independent Sets in Subgraphs of a Shift Graph. Electron. J. Comb. 29 (1) (2022)
Vojtech Rödl, Andrzej Rucinski
Covering the edges of a random hypergraph by cliques. Discuss. Math. Graph Theory 42 (4) (2022)
Michal Koucký, Vojtech Rödl, Navid Talebanfard
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. CoRR (2021)
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
Ramsey-type numbers involving graphs and hypergraphs with large girth. Comb. Probab. Comput. 30 (5) (2021)
Andrii Arman, Bradley Elliott, Vojtech Rödl
Increasing paths in countable graphs. J. Comb. Theory, Ser. A 183 (2021)
Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales
Every Steiner triple system contains almost spanning d-ary hypertree. CoRR (2021)
Yoshiharu Kohayakawa, Sang June Lee, Carlos Gustavo Moreira, Vojtech Rödl
On strong Sidon sets of integers. J. Comb. Theory, Ser. A 183 (2021)
Joanna Polcyn, Christian Reiher, Vojtech Rödl, Bjarne Schülke
On Hamiltonian cycles in hypergraphs with dense link graphs. J. Comb. Theory, Ser. B 150 (2021)
Peter Frankl, Hao Huang, Vojtech Rödl
On local Turán problems. J. Comb. Theory, Ser. A 177 (2021)
Sören Berger, Simón Piga, Christian Reiher, Vojtech Rödl, Mathias Schacht
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links. LAGOS (2021)
Michal Koucký, Vojtech Rödl, Navid Talebanfard
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Log. Methods Comput. Sci. 17 (4) (2021)
Andrii Arman, Bill Kay, Vojtech Rödl
A note on weak delta systems. Discret. Math. 342 (11) (2019)
Pavel Pudlák, Vojtech Rödl
Extractors for small zero-fixing sources. CoRR (2019)
Michal Koucký, Vojtech Rödl, Navid Talebanfard
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Electron. Colloquium Comput. Complex. 26 (2019)
Domingos Dellamonica Jr., Vojtech Rödl
Packing Paths in Steiner Triple Systems. SIAM J. Discret. Math. 33 (3) (2019)
Yoshiharu Kohayakawa, Troy Retter, Vojtech Rödl
The size Ramsey number of short subdivisions of bounded degree graphs. Random Struct. Algorithms 54 (2) (2019)
Pavel Pudlák, Vojtech Rödl
Extractors for small zero-fixing sources. Electron. Colloquium Comput. Complex. 26 (2019)
Hiêp Hàn, Vojtech Rödl, Tibor Szabó
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs. SIAM J. Discret. Math. 32 (2) (2018)
Yoshiharu Kohayakawa, Sangjune Lee, Carlos Gustavo Moreira, Vojtech Rödl
Infinite Sidon Sets Contained in Sparse Random Sets of Integers. SIAM J. Discret. Math. 32 (1) (2018)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
An algorithmic hypergraph regularity lemma. Random Struct. Algorithms 52 (2) (2018)
Dwight Duffus, Bill Kay, Vojtech Rödl
The Minimum Number of Edges in Uniform Hypergraphs with Property O. Comb. Probab. Comput. 27 (4) (2018)
Jaroslav Nesetril, Vojtech Rödl
Ramsey Partial Orders from Acyclic Graphs. Order 35 (2) (2018)
Vindya Bhat, Jaroslav Nesetril, Christian Reiher, Vojtech Rödl
A Ramsey class for Steiner systems. J. Comb. Theory, Ser. A 154 (2018)
Christian Reiher, Vojtech Rödl, Mathias Schacht
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. J. Lond. Math. Soc. 97 (1) (2018)
Andrii Arman, Vojtech Rödl
Note on a Ramsey Theorem for Posets with Linear Extensions. Electron. J. Comb. 24 (4) (2017)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
The complexity of proving that a graph is Ramsey. Comb. 37 (2) (2017)
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
An exponential-type upper bound for Folkman numbers. Comb. 37 (4) (2017)
Christian Avart, Bill Kay, Christian Reiher, Vojtech Rödl
The chromatic number of finite type-graphs. J. Comb. Theory, Ser. B 122 (2017)
Andrzej Dudek, Steve La Fleur, Dhruv Mubayi, Vojtech Rödl
On the Size-Ramsey Number of Hypergraphs. J. Graph Theory 86 (1) (2017)
Vojtech Rödl, Andrzej Rucinski, Mathias Schacht
Ramsey properties of random graphs and Folkman numbers. Discuss. Math. Graph Theory 37 (3) (2017)
Domingos Dellamonica Jr., Steve La Fleur, Vojtech Rödl
-uniform hypergraphs. Random Struct. Algorithms 48 (1) (2016)
Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl
A note on supersaturated set systems. Eur. J. Comb. 51 (2016)
Paul Horn, Václav Koubek, Vojtech Rödl
Isomorphic edge disjoint subgraphs of hypergraphs. Random Struct. Algorithms 48 (4) (2016)
Silvia Messuti, Vojtech Rödl, Mathias Schacht
Packing minor-closed families of graphs into complete graphs. J. Comb. Theory, Ser. B 119 (2016)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
-sets of a given cardinality. J. Comb. Theory, Ser. A 142 (2016)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
-Sets. Comb. Probab. Comput. 25 (1) (2016)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
An Algorithmic Hypergraph Regularity Lemma. SODA (2016)
Christian Reiher, Vojtech Rödl, Mathias Schacht
Embedding tetrahedra into quasirandom hypergraphs. J. Comb. Theory, Ser. B 121 (2016)
Vindya Bhat, Vojtech Rödl
A short proof of the induced Ramsey Theorem for hypergraphs. Discret. Math. 339 (3) (2016)
Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Struct. Algorithms 46 (1) (2015)
Silvia Messuti, Vojtech Rödl, Mathias Schacht
Packing minor closed families of graphs. Electron. Notes Discret. Math. 49 (2015)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
An improved upper bound on the density of universal random graphs. Random Struct. Algorithms 46 (2) (2015)
Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira
An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions. Comb. Probab. Comput. 24 (2) (2015)
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
Ramsey-type numbers involving graphs and hypergraphs with large girth. Electron. Notes Discret. Math. 50 (2015)
Paul Horn, Kevin G. Milans, Vojtech Rödl
Degree Ramsey Numbers of Closed Blowups of Trees. Electron. J. Comb. 21 (2) (2014)
Vojtech Rödl, Andrzej Rucinski
Families of triples with high minimum degree are Hamiltonian. Discuss. Math. Graph Theory 34 (2) (2014)
Andrzej Dudek, Troy Retter, Vojtech Rödl
On generalized Ramsey numbers of Erdős and Rogers. J. Comb. Theory, Ser. B 109 (2014)
Christian Avart, Péter Komjáth, Vojtech Rödl
-spaces. Period. Math. Hung. 66 (2) (2013)
Paul Horn, Steve La Fleur, Vojtech Rödl
Jumps and Nonjumps in Multigraphs. SIAM J. Discret. Math. 27 (2) (2013)
Vindya Bhat, Vojtech Rödl
Note on Upper Density of Quasi-Random Hypergraphs. Electron. J. Comb. 20 (2) (2013)
Andrzej Dudek, Peter Frankl, Vojtech Rödl
Some recent results on Ramsey-type numbers. Discret. Appl. Math. 161 (9) (2013)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
The Complexity of Proving That a Graph Is Ramsey. ICALP (1) (2013)
Dwight Duffus, Peter Frankl, Vojtech Rödl
Maximal independent sets in the covering graph of the cube. Discret. Appl. Math. 161 (9) (2013)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
The complexity of proving that a graph is Ramsey. Electron. Colloquium Comput. Complex. 20 (2013)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
The complexity of proving that a graph is Ramsey CoRR (2013)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
Universality of Random Graphs. SIAM J. Discret. Math. 26 (1) (2012)
Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. J. Comb. Theory, Ser. A 119 (6) (2012)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
An Improved Upper Bound on the Density of Universal Random Graphs. LATIN (2012)
Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. SIAM J. Discret. Math. 26 (1) (2012)
Vojtech Rödl, Mathias Schacht
Complete Partite subgraphs in dense hypergraphs. Random Struct. Algorithms 41 (4) (2012)
Andrzej Dudek, Reshma Ramadurai, Vojtech Rödl
On induced Folkman numbers. Random Struct. Algorithms 40 (4) (2012)
Peter Frankl, Vojtech Rödl, Andrzej Rucinski
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size. Comb. Probab. Comput. 21 (1-2) (2012)
Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21 (1-2) (2012)
Domingos Dellamonica Jr., Vojtech Rödl
Distance Preserving Ramsey Graphs. Comb. Probab. Comput. 21 (4) (2012)
Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl
The maximum size of a Sidon set contained in a sparse random set of integers. SODA (2011)
Domingos Dellamonica Jr., Vojtech Rödl
A note on Thomassenʼs conjecture. J. Comb. Theory, Ser. B 101 (6) (2011)
Domingos Dellamonica Jr., Vojtech Rödl
Hereditary quasirandom properties of hypergraphs. Comb. 31 (2) (2011)
Dwight Duffus, Peter Frankl, Vojtech Rödl
Maximal independent sets in bipartite graphs obtained from Boolean lattices. Eur. J. Comb. 32 (1) (2011)
Domingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl
On a conjecture of Thomassen concerning subgraphs of large girth. J. Graph Theory 67 (4) (2011)
Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. APPROX-RANDOM (2011)
Andrzej Dudek, Vojtech Rödl
-free graphs and vertex Folkman numbers. Comb. 31 (1) (2011)
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM J. Comput. 39 (6) (2010)
Alexandr V. Kostochka, Vojtech Rödl
Constructions of sparse uniform hypergraphs with high chromatic number. Random Struct. Algorithms 36 (1) (2010)
Andrzej Dudek, Vojtech Rödl
An almost quadratic bound on vertex Folkman numbers. J. Comb. Theory, Ser. B 100 (2) (2010)
Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl
Some constructive bounds on Ramsey numbers. J. Comb. Theory, Ser. B 100 (5) (2010)
Václav Koubek, Vojtech Rödl
On the number of graphs with a given endomorphism monoid. Discret. Math. 310 (3) (2010)
Ehud Friedgut, Vojtech Rödl, Mathias Schacht
Ramsey properties of random discrete structures. Random Struct. Algorithms 37 (4) (2010)
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht
Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory, Ser. B 100 (2) (2010)
Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers
Note on robust critical graphs with large odd girth. Discret. Math. 310 (3) (2010)
Andrzej Dudek, Peter Frankl, Vojtech Rödl
A Note on Universal and Canonically Coloured Sequences. Comb. Probab. Comput. 18 (5) (2009)
Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht
Hypergraph regularity and quasi-randomness. SODA (2009)
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Comb. Probab. Comput. 18 (1-2) (2009)
Vojtech Rödl, Mathias Schacht
Generalizations of the removal lemma. Comb. 29 (4) (2009)
Václav Koubek, Vojtech Rödl, Benjamin Shemmer
Representing Subdirect Product Monoids by Graphs. Int. J. Algebra Comput. 19 (5) (2009)
Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht
On Colourings of Hypergraphs Without Monochromatic Fano Planes. Comb. Probab. Comput. 18 (5) (2009)
Domingos Dellamonica Jr., Vojtech Rödl
Hereditary quasi-random properties of hypergraphs. Electron. Notes Discret. Math. 34 (2009)
Václav Koubek, Vojtech Rödl, Benjamin Shemmer
On graphs with a given endomorphism monoid. J. Graph Theory 62 (3) (2009)
Andrzej Dudek, Esmeralda Nastase, Vojtech Rödl
On k-chromatically connected graphs. Discret. Math. 309 (18) (2009)
Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Comb. Theory, Ser. A 116 (3) (2009)
Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl
Colorful Flowers. Electron. Notes Discret. Math. 31 (2008)
Vojtech Rödl, Jan Zich
Triangulations and the Hajós conjecture. J. Graph Theory 59 (4) (2008)
Jan Zich, Yoshiharu Kohayakawa, Vojtech Rödl, V. Sunderam
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness. Internet Math. 5 (3) (2008)
Vojtech Rödl, Mark H. Siggers
On Ramsey Minimal Graphs. SIAM J. Discret. Math. 22 (2) (2008)
Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht
On the Ramsey Number of Sparse 3-Graphs. Graphs Comb. 24 (3) (2008)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
Universality of random graphs. SODA (2008)

Vojtech Rödl.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vojtech Rödl