Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarVojtech Rödl
Vojtěch Rödl
Person information
- unicode name: Vojtěch Rödl
- affiliation: Emory University, Atlanta, Department of Mathematics and Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j259]Andrii Arman, Bill Kay, Vojtech Rödl:
A note on weak delta systems. Discrete Mathematics 342(11): 3034-3042 (2019)- [j258]Yoshiharu Kohayakawa
, Troy Retter, Vojtech Rödl:
The size Ramsey number of short subdivisions of bounded degree graphs. Random Struct. Algorithms 54(2): 304-339 (2019) - [j257]Domingos Dellamonica Jr., Vojtech Rödl:
Packing Paths in Steiner Triple Systems. SIAM J. Discrete Math. 33(3): 1669-1690 (2019) - [i4]Pavel Pudlák, Vojtech Rödl:
Extractors for small zero-fixing sources. CoRR abs/1904.07949 (2019) - [i3]Pavel Pudlák, Vojtech Rödl:
Extractors for small zero-fixing sources. Electronic Colloquium on Computational Complexity (ECCC) 26: 58 (2019) - 2018
- [j256]Dwight Duffus, Bill Kay, Vojtech Rödl:
The Minimum Number of Edges in Uniform Hypergraphs with Property O. Combinatorics, Probability & Computing 27(4): 531-538 (2018) - [j255]Vindya Bhat, Jaroslav Nesetril, Christian Reiher, Vojtech Rödl:
A Ramsey class for Steiner systems. J. Comb. Theory, Ser. A 154: 323-349 (2018) - [j254]Christian Reiher, Vojtech Rödl, Mathias Schacht:
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. J. London Math. Society 97(1): 77-97 (2018) - [j253]Jaroslav Nesetril, Vojtech Rödl:
Ramsey Partial Orders from Acyclic Graphs. Order 35(2): 293-300 (2018) - [j252]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
An algorithmic hypergraph regularity lemma. Random Struct. Algorithms 52(2): 301-353 (2018) - [j251]Yoshiharu Kohayakawa, Sangjune Lee, Carlos Gustavo Moreira, Vojtech Rödl:
Infinite Sidon Sets Contained in Sparse Random Sets of Integers. SIAM J. Discrete Math. 32(1): 410-449 (2018) - [j250]Hiêp Hàn, Vojtech Rödl, Tibor Szabó:
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs. SIAM J. Discrete Math. 32(2): 826-838 (2018) - 2017
- [j249]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Combinatorica 37(2): 253-268 (2017) - [j248]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
An exponential-type upper bound for Folkman numbers. Combinatorica 37(4): 767-784 (2017) - [j247]Andrii Arman, Vojtech Rödl:
Note on a Ramsey Theorem for Posets with Linear Extensions. Electr. J. Comb. 24(4): P4.36 (2017) - [j246]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
Ramsey properties of random graphs and Folkman numbers. Discussiones Mathematicae Graph Theory 37(3): 755-776 (2017) - [j245]Christian Avart, Bill Kay, Christian Reiher, Vojtech Rödl:
The chromatic number of finite type-graphs. J. Comb. Theory, Ser. B 122: 877-896 (2017) - [j244]Andrzej Dudek, Steve La Fleur, Dhruv Mubayi, Vojtech Rödl:
On the Size-Ramsey Number of Hypergraphs. Journal of Graph Theory 86(1): 104-121 (2017) - 2016
- [j243]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
On the Number of Bh -Sets. Combinatorics, Probability & Computing 25(1): 108-129 (2016) - [j242]Vindya Bhat, Vojtech Rödl:
A short proof of the induced Ramsey Theorem for hypergraphs. Discrete Mathematics 339(3): 1147-1149 (2016) - [j241]Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl:
A note on supersaturated set systems. Eur. J. Comb. 51: 190-199 (2016) - [j240]Silvia Messuti, Vojtech Rödl, Mathias Schacht:
Packing minor-closed families of graphs into complete graphs. J. Comb. Theory, Ser. B 119: 245-265 (2016) - [j239]Christian Reiher, Vojtech Rödl, Mathias Schacht:
Embedding tetrahedra into quasirandom hypergraphs. J. Comb. Theory, Ser. B 121: 229-247 (2016) - [j238]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of B3-sets of a given cardinality. J. Comb. Theory, Ser. A 142: 44-76 (2016) - [j237]Domingos Dellamonica Jr., Steve La Fleur, Vojtech Rödl:
On induced Ramsey numbers for k-uniform hypergraphs. Random Struct. Algorithms 48(1): 5-20 (2016) - [j236]Paul Horn, Václav Koubek, Vojtech Rödl:
Isomorphic edge disjoint subgraphs of hypergraphs. Random Struct. Algorithms 48(4): 767-793 (2016) - [c25]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
An Algorithmic Hypergraph Regularity Lemma. SODA 2016: 1765-1773 - 2015
- [j235]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions. Combinatorics, Probability & Computing 24(2): 407-437 (2015) - [j234]Silvia Messuti, Vojtech Rödl, Mathias Schacht:
Packing minor closed families of graphs. Electronic Notes in Discrete Mathematics 49: 651-659 (2015) - [j233]Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht:
Ramsey-type numbers involving graphs and hypergraphs with large girth. Electronic Notes in Discrete Mathematics 50: 457-463 (2015) - [j232]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): 1-25 (2015) - [j231]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): 274-299 (2015) - 2014
- [j230]Paul Horn, Kevin G. Milans, Vojtech Rödl:
Degree Ramsey Numbers of Closed Blowups of Trees. Electr. J. Comb. 21(2): P2.5 (2014) - [j229]Vojtech Rödl, Andrzej Rucinski:
Families of triples with high minimum degree are Hamiltonian. Discussiones Mathematicae Graph Theory 34(2): 361-381 (2014) - [j228]Andrzej Dudek, Troy Retter, Vojtech Rödl:
On generalized Ramsey numbers of Erdős and Rogers. J. Comb. Theory, Ser. B 109: 213-227 (2014) - 2013
- [j227]Vindya Bhat, Vojtech Rödl:
Note on Upper Density of Quasi-Random Hypergraphs. Electr. J. Comb. 20(2): P59 (2013) - [j226]Andrzej Dudek, Peter Frankl, Vojtech Rödl:
Some recent results on Ramsey-type numbers. Discrete Applied Mathematics 161(9): 1197-1202 (2013) - [j225]Dwight Duffus, Peter Frankl, Vojtech Rödl:
Maximal independent sets in the covering graph of the cube. Discrete Applied Mathematics 161(9): 1203-1208 (2013) - [j224]Christian Avart, Péter Komjáth, Vojtech Rödl:
Note on the point character of l 1-spaces. Periodica Mathematica Hungarica 66(2): 181-192 (2013) - [j223]Paul Horn, Steve La Fleur, Vojtech Rödl:
Jumps and Nonjumps in Multigraphs. SIAM J. Discrete Math. 27(2): 1040-1054 (2013) - [c24]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The Complexity of Proving That a Graph Is Ramsey. ICALP (1) 2013: 684-695 - [p1]Vojtech Rödl, Robin Thomas:
Arrangeability and Clique Subdivisions. The Mathematics of Paul Erdős II 2013: 233-236 - [i2]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. CoRR abs/1303.3166 (2013) - [i1]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Electronic Colloquium on Computational Complexity (ECCC) 20: 38 (2013) - 2012
- [j222]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. Combinatorics, Probability & Computing 21(1-2): 113-127 (2012) - [j221]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. Combinatorics, Probability & Computing 21(1-2): 141-148 (2012) - [j220]Domingos Dellamonica Jr., Vojtech Rödl:
Distance Preserving Ramsey Graphs. Combinatorics, Probability & Computing 21(4): 554-581 (2012) - [j219]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): 1200-1215 (2012) - [j218]Andrzej Dudek, Reshma Ramadurai, Vojtech Rödl:
On induced Folkman numbers. Random Struct. Algorithms 40(4): 493-500 (2012) - [j217]Vojtech Rödl, Mathias Schacht:
Complete Partite subgraphs in dense hypergraphs. Random Struct. Algorithms 41(4): 557-573 (2012) - [j216]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. SIAM J. Discrete Math. 26(1): 15-29 (2012) - [j215]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of Random Graphs. SIAM J. Discrete Math. 26(1): 353-374 (2012) - [c23]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An Improved Upper Bound on the Density of Universal Random Graphs. LATIN 2012: 231-242 - 2011
- [j214]Andrzej Dudek, Vojtech Rödl:
On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers. Combinatorica 31(1): 39-53 (2011) - [j213]Domingos Dellamonica Jr., Vojtech Rödl:
Hereditary quasirandom properties of hypergraphs. Combinatorica 31(2): 165-182 (2011) - [j212]Dwight Duffus, Peter Frankl, Vojtech Rödl:
Maximal independent sets in bipartite graphs obtained from Boolean lattices. Eur. J. Comb. 32(1): 1-9 (2011) - [j211]Domingos Dellamonica Jr., Vojtech Rödl:
A note on Thomassenʼs conjecture. J. Comb. Theory, Ser. B 101(6): 509-515 (2011) - [j210]Domingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl:
On a conjecture of Thomassen concerning subgraphs of large girth. Journal of Graph Theory 67(4): 316-331 (2011) - [c22]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: 495-506 - [c21]Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl:
The maximum size of a Sidon set contained in a sparse random set of integers. SODA 2011: 159-171 - 2010
- [j209]Václav Koubek, Vojtech Rödl:
On the number of graphs with a given endomorphism monoid. Discrete Mathematics 310(3): 376-384 (2010) - [j208]Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers:
Note on robust critical graphs with large odd girth. Discrete Mathematics 310(3): 499-504 (2010) - [j207]Andrzej Dudek, Vojtech Rödl:
An almost quadratic bound on vertex Folkman numbers. J. Comb. Theory, Ser. B 100(2): 132-140 (2010) - [j206]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory, Ser. B 100(2): 151-160 (2010) - [j205]Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl:
Some constructive bounds on Ramsey numbers. J. Comb. Theory, Ser. B 100(5): 439-445 (2010) - [j204]Alexandr V. Kostochka, Vojtech Rödl:
Constructions of sparse uniform hypergraphs with high chromatic number. Random Struct. Algorithms 36(1): 46-56 (2010) - [j203]Ehud Friedgut, Vojtech Rödl, Mathias Schacht:
Ramsey properties of random discrete structures. Random Struct. Algorithms 37(4): 407-436 (2010) - [j202]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): 2336-2362 (2010)
2000 – 2009
- 2009
- [j201]Vojtech Rödl, Mathias Schacht:
Generalizations of the removal lemma. Combinatorica 29(4): 467-501 (2009) - [j200]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan:
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Combinatorics, Probability & Computing 18(1-2): 165-203 (2009) - [j199]Andrzej Dudek, Peter Frankl, Vojtech Rödl:
A Note on Universal and Canonically Coloured Sequences. Combinatorics, Probability & Computing 18(5): 683-689 (2009) - [j198]Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht:
On Colourings of Hypergraphs Without Monochromatic Fano Planes. Combinatorics, Probability & Computing 18(5): 803-818 (2009) - [j197]Andrzej Dudek, Esmeralda Nastase, Vojtech Rödl:
On k-chromatically connected graphs. Discrete Mathematics 309(18): 5547-5550 (2009) - [j196]Domingos Dellamonica Jr., Vojtech Rödl:
Hereditary quasi-random properties of hypergraphs. Electronic Notes in Discrete Mathematics 34: 495-499 (2009) - [j195]Václav Koubek, Vojtech Rödl, Benjamin Shemmer:
Representing Subdirect Product Monoids by Graphs. IJAC 19(5): 705-721 (2009) - [j194]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): 613-636 (2009) - [j193]Václav Koubek, Vojtech Rödl, Benjamin Shemmer:
On graphs with a given endomorphism monoid. Journal of Graph Theory 62(3): 241-262 (2009) - [c20]Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht:
Hypergraph regularity and quasi-randomness. SODA 2009: 227-235 - 2008
- [j192]Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski:
An approximate Dirac-type theorem for k -uniform hypergraphs. Combinatorica 28(2): 229-260 (2008) - [j191]Andrzej Dudek, Vojtech Rödl:
On the Turán Properties of Infinite Graphs. Electr. J. Comb. 15(1) (2008) - [j190]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Note on the 3-graph counting lemma. Discrete Mathematics 308(19): 4501-4517 (2008) - [j189]Andrzej Dudek, Vojtech Rödl:
On the Folkman Number f(2, 3, 4). Experimental Mathematics 17(1): 63-67 (2008) - [j188]Andrzej Dudek, Vojtech Rödl:
Finding Folkman Numbers via MAX CUT Problem. Electronic Notes in Discrete Mathematics 30: 99-104 (2008) - [j187]Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl:
Colorful Flowers. Electronic Notes in Discrete Mathematics 31: 255-258 (2008) - [j186]Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht:
On the Ramsey Number of Sparse 3-Graphs. Graphs and Combinatorics 24(3): 205-228 (2008) - [j185]Jan Zich, Yoshiharu Kohayakawa, Vojtech Rödl, V. Sunderam:
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness. Internet Mathematics 5(3): 227-250 (2008) - [j184]Vojtech Rödl, Jan Zich:
Triangulations and the Hajós conjecture. Journal of Graph Theory 59(4): 293-325 (2008) - [j183]Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
An Algorithmic Version of the Hypergraph Regularity Method. SIAM J. Comput. 37(6): 1728-1776 (2008) - [j182]Vojtech Rödl, Mark H. Siggers:
On Ramsey Minimal Graphs. SIAM J. Discrete Math. 22(2): 467-488 (2008) - [c19]Andrzej Dudek, Vojtech Rödl:
New Upper Bound on Vertex Folkman Numbers. LATIN 2008: 473-478 - [c18]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of random graphs. SODA 2008: 782-788 - 2007
- [j181]Vojtech Rödl, Mathias Schacht:
Regular Partitions of Hypergraphs: Regularity Lemmas. Combinatorics, Probability & Computing 16(6): 833-885 (2007) - [j180]Vojtech Rödl, Mathias Schacht:
Regular Partitions of Hypergraphs: Counting Lemmas. Combinatorics, Probability & Computing 16(6): 887-901 (2007) - [j179]Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger:
Small subsets inherit sparse epsilon-regularity. J. Comb. Theory, Ser. B 97(1): 34-56 (2007) - [j178]Dhruv Mubayi, Vojtech Rödl:
On the chromatic number and independence number of hypergraph products. J. Comb. Theory, Ser. B 97(1): 151-155 (2007) - [j177]Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot:
A note on the jumping constant conjecture of Erdös. J. Comb. Theory, Ser. B 97(2): 204-216 (2007) - [j176]Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige:
Integer and fractional packings of hypergraphs. J. Comb. Theory, Ser. B 97(2): 245-268 (2007) - [j175]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa Sissokho, Jozef Skokan:
Turán's theorem for pseudo-random graphs. J. Comb. Theory, Ser. A 114(4): 631-657 (2007) - [j174]Christian Avart, Vojtech Rödl, Mathias Schacht:
Every Monotone 3-Graph Property is Testable. SIAM J. Discrete Math. 21(1): 73-92 (2007) - [j173]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. Discrete Math. 21(2): 442-460 (2007) - [c17]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. ICALP 2007: 789-800 - [c16]Vojtech Rödl, Mathias Schacht:
Property testing in hypergraphs and the removal lemma. STOC 2007: 488-495 - 2006
- [b1]Ehud Friedgut, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali:
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring. Memoirs of the American Mathematical Society 845, American Mathematical Society 2006, ISBN 978-0-8218-3825-9, pp. 1-66 - [j172]Dhruv Mubayi, Vojtech Rödl:
Supersaturation For Ramsey-Turán Problems. Combinatorica 26(3): 315-332 (2006) - [j171]Noga Alon, Yoshiharu Kohayakawa, Christian Mauduit, Carlos Gustavo T. de A. Moreira, Vojtech Rödl:
Measures of Pseudorandomness for Finite Sequences: Minimal Values. Combinatorics, Probability & Computing 15(1-2): 1-29 (2006) - [j170]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
A Dirac-Type Theorem for 3-Uniform Hypergraphs. Combinatorics, Probability & Computing 15(1-2): 229-251 (2006) - [j169]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Perfect matchings in uniform hypergraphs with large minimum degree. Eur. J. Comb. 27(8): 1333-1349 (2006) - [j168]Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Short paths in quasi-random triple systems with sparse underlying graphs. J. Comb. Theory, Ser. B 96(4): 584-607 (2006) - [j167]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan:
The Ramsey number for hypergraph cycles I. J. Comb. Theory, Ser. A 113(1): 67-83 (2006) - [j166]Vojtech Rödl, Eduardo Tengan:
A note on a conjecture by Füredi. J. Comb. Theory, Ser. A 113(6): 1214-1218 (2006) - [j165]Alexandr V. Kostochka, Vojtech Rödl:
On Ramsey numbers of uniform hypergraphs with given maximum degree. J. Comb. Theory, Ser. A 113(7): 1555-1564 (2006) - [j164]Vojtech Rödl, Mark H. Siggers:
Color critical hypergraphs with many edges. Journal of Graph Theory 53(1): 56-74 (2006) - [j163]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
The counting lemma for regular k-uniform hypergraphs. Random Struct. Algorithms 28(2): 113-179 (2006) - [j162]Vojtech Rödl, Jozef Skokan:
Applications of the regularity lemma for uniform hypergraphs. Random Struct. Algorithms 28(2): 180-194 (2006) - 2005
- [j161]Noga Alon, Vojtech Rödl:
Sharp Bounds For Some Multicolor Ramsey Numbers. Combinatorica 25(2): 125-141 (2005) - [j160]Mike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl:
Distance Graphs on the Integers. Combinatorics, Probability & Computing 14(1-2): 107-131 (2005) - [j159]Yuejian Peng, Vojtech Rödl, Jozef Skokan:
Counting Small Cliques in 3-uniform Hypergraphs. Combinatorics, Probability & Computing 14(3): 371-413 (2005) - [j158]Vojtech Rödl, Lubos Thoma:
On Cover Graphs and Dependent Arcs in Acyclic Orientations. Combinatorics, Probability & Computing 14(4): 585-617 (2005) - [j157]Christian Avart, Vojtech Rödl, Mathias Schacht:
Every Monotone 3-Graph Property is Testable. Electronic Notes in Discrete Mathematics 22: 539-542 (2005) - [j156]Vojtech Rödl, Jozef Skokan:
Counting subgraphs in quasi-random 4-uniform hypergraphs. Random Struct. Algorithms 26(1-2): 160-203 (2005) - [c15]Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
An Algorithmic Version of the Hypergraph Regularity Method. FOCS 2005: 439-448 - [c14]Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl:
The Generalization of Dirac's Theorem for Hypergraphs. MFCS 2005: 52-56 - 2004
- [j155]Alexandr V. Kostochka, Vojtech Rödl:
On Graphs With Small Ramsey Numbers, II. Combinatorica 24(3): 389-401 (2004) - [j154]Dhruv Mubayi, Vojtech Rödl:
Uniform Edge Distribution in Hypergraphs is Hereditary. Electr. J. Comb. 11(1) (2004) - [j153]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht:
The Turán Theorem for Random Graphs. Combinatorics, Probability & Computing 13(1): 61-91 (2004) - [j152]