default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVojtech Rödl
Vojtěch Rödl
Person information
- unicode name: Vojtěch Rödl
- affiliation: Emory University, Atlanta, Department of Mathematics and Computer Science
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j276]Jaroslav Nesetril, Vojtech Rödl, Marcelo Tadeu Sales:
On Pisier Type Theorems. Comb. 44(6): 1211-1232 (2024)- [j275]Bryce Frederickson, Vojtech Rödl, Marcelo Tadeu Sales:
A note on the induced Ramsey theorem for spaces. Comb. Theory 4(2) (2024) - [j274]Pavel Pudlák, Vojtech Rödl, Marcelo Tadeu Sales
:
On the Ramsey numbers of daisies I. Comb. Probab. Comput. 33(6): 795-806 (2024) - 2023
- [j273]Vojtech Rödl, Marcelo Tadeu Sales, Yi Zhao:
Independence number of hypergraphs under degree conditions. Random Struct. Algorithms 63(3): 821-863 (2023) - [j272]Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales:
Colorful Matchings. SIAM J. Discret. Math. 37(2): 925-950 (2023) - 2022
- [j271]Pavel Pudlák, Vojtech Rödl:
Extractors for Small Zero-Fixing Sources. Comb. 42(4): 587-616 (2022) - [j270]Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales:
Independent Sets in Subgraphs of a Shift Graph. Electron. J. Comb. 29(1) (2022) - [j269]Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales:
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree. Electron. J. Comb. 29(3) (2022) - [j268]Vojtech Rödl, Marcelo Tadeu Sales:
A blurred view of Van der Waerden type theorems. Comb. Probab. Comput. 31(4): 684-701 (2022) - [j267]Vojtech Rödl, Andrzej Rucinski:
Covering the edges of a random hypergraph by cliques. Discuss. Math. Graph Theory 42(4): 1333-1349 (2022) - 2021
- [j266]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): 722-740 (2021) - [j265]Peter Frankl, Hao Huang, Vojtech Rödl:
On local Turán problems. J. Comb. Theory A 177: 105329 (2021) - [j264]Yoshiharu Kohayakawa, Sang June Lee, Carlos Gustavo Moreira, Vojtech Rödl:
On strong Sidon sets of integers. J. Comb. Theory A 183: 105490 (2021) - [j263]Andrii Arman, Bradley Elliott, Vojtech Rödl:
Increasing paths in countable graphs. J. Comb. Theory A 183: 105491 (2021) - [j262]Joanna Polcyn, Christian Reiher, Vojtech Rödl, Bjarne Schülke:
On Hamiltonian cycles in hypergraphs with dense link graphs. J. Comb. Theory B 150: 17-75 (2021) - [j261]Michal Koucký, Vojtech Rödl, Navid Talebanfard:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Log. Methods Comput. Sci. 17(4) (2021) - [c26]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: 412-418 - [i7]Michal Koucký, Vojtech Rödl, Navid Talebanfard:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. CoRR abs/2105.06744 (2021) - [i6]Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales:
Every Steiner triple system contains almost spanning d-ary hypertree. CoRR abs/2105.10969 (2021)
2010 – 2019
- 2019
- [j260]Andrii Arman, Bill Kay, Vojtech Rödl:
A note on weak delta systems. Discret. Math. 342(11): 3034-3042 (2019) - [j259]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) - [j258]Domingos Dellamonica Jr., Vojtech Rödl:
Packing Paths in Steiner Triple Systems. SIAM J. Discret. Math. 33(3): 1669-1690 (2019) - [i5]Pavel Pudlák, Vojtech Rödl:
Extractors for small zero-fixing sources. CoRR abs/1904.07949 (2019) - [i4]Michal Koucký, Vojtech Rödl, Navid Talebanfard:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Electron. Colloquium Comput. Complex. TR19 (2019) - [i3]Pavel Pudlák, Vojtech Rödl:
Extractors for small zero-fixing sources. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j257]Dwight Duffus, Bill Kay, Vojtech Rödl:
The Minimum Number of Edges in Uniform Hypergraphs with Property O. Comb. Probab. Comput. 27(4): 531-538 (2018) - [j256]Vindya Bhat, Jaroslav Nesetril, Christian Reiher, Vojtech Rödl:
A Ramsey class for Steiner systems. J. Comb. Theory A 154: 323-349 (2018) - [j255]Christian Reiher, Vojtech Rödl, Mathias Schacht:
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. J. Lond. Math. Soc. 97(1): 77-97 (2018) - [j254]Jaroslav Nesetril, Vojtech Rödl:
Ramsey Partial Orders from Acyclic Graphs. Order 35(2): 293-300 (2018) - [j253]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
An algorithmic hypergraph regularity lemma. Random Struct. Algorithms 52(2): 301-353 (2018) - [j252]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): 410-449 (2018) - [j251]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): 826-838 (2018) - 2017
- [j250]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Comb. 37(2): 253-268 (2017) - [j249]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
An exponential-type upper bound for Folkman numbers. Comb. 37(4): 767-784 (2017) - [j248]Andrii Arman, Vojtech Rödl:
Note on a Ramsey Theorem for Posets with Linear Extensions. Electron. J. Comb. 24(4): 4 (2017) - [j247]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
Ramsey properties of random graphs and Folkman numbers. Discuss. Math. Graph Theory 37(3): 755-776 (2017) - [j246]Christian Avart, Bill Kay, Christian Reiher, Vojtech Rödl:
The chromatic number of finite type-graphs. J. Comb. Theory B 122: 877-896 (2017) - [j245]Andrzej Dudek, Steve La Fleur, Dhruv Mubayi, Vojtech Rödl:
On the Size-Ramsey Number of Hypergraphs. J. Graph Theory 86(1): 104-121 (2017) - 2016
- [j244]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
On the Number of Bh -Sets. Comb. Probab. Comput. 25(1): 108-129 (2016) - [j243]Vindya Bhat, Vojtech Rödl:
A short proof of the induced Ramsey Theorem for hypergraphs. Discret. Math. 339(3): 1147-1149 (2016) - [j242]Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl:
A note on supersaturated set systems. Eur. J. Comb. 51: 190-199 (2016) - [j241]Silvia Messuti, Vojtech Rödl, Mathias Schacht:
Packing minor-closed families of graphs into complete graphs. J. Comb. Theory B 119: 245-265 (2016) - [j240]Christian Reiher, Vojtech Rödl, Mathias Schacht:
Embedding tetrahedra into quasirandom hypergraphs. J. Comb. Theory B 121: 229-247 (2016) - [j239]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of B3-sets of a given cardinality. J. Comb. Theory A 142: 44-76 (2016) - [j238]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) - [j237]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
- [j236]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): 407-437 (2015) - [j235]Silvia Messuti, Vojtech Rödl, Mathias Schacht:
Packing minor closed families of graphs. Electron. Notes Discret. Math. 49: 651-659 (2015) - [j234]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: 457-463 (2015) - [j233]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) - [j232]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
- [j231]Paul Horn, Kevin G. Milans, Vojtech Rödl:
Degree Ramsey Numbers of Closed Blowups of Trees. Electron. J. Comb. 21(2): 2 (2014) - [j230]Vojtech Rödl, Andrzej Rucinski:
Families of triples with high minimum degree are Hamiltonian. Discuss. Math. Graph Theory 34(2): 361-381 (2014) - [j229]Andrzej Dudek, Troy Retter, Vojtech Rödl:
On generalized Ramsey numbers of Erdős and Rogers. J. Comb. Theory B 109: 213-227 (2014) - 2013
- [j228]Vindya Bhat, Vojtech Rödl:
Note on Upper Density of Quasi-Random Hypergraphs. Electron. J. Comb. 20(2): 59 (2013) - [j227]Andrzej Dudek, Peter Frankl, Vojtech Rödl:
Some recent results on Ramsey-type numbers. Discret. Appl. Math. 161(9): 1197-1202 (2013) - [j226]Dwight Duffus, Peter Frankl, Vojtech Rödl:
Maximal independent sets in the covering graph of the cube. Discret. Appl. Math. 161(9): 1203-1208 (2013) - [j225]Christian Avart, Péter Komjáth, Vojtech Rödl:
Note on the point character of l 1-spaces. Period. Math. Hung. 66(2): 181-192 (2013) - [j224]Paul Horn, Steve La Fleur, Vojtech Rödl:
Jumps and Nonjumps in Multigraphs. SIAM J. Discret. 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. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j223]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): 113-127 (2012) - [j222]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): 141-148 (2012) - [j221]Domingos Dellamonica Jr., Vojtech Rödl:
Distance Preserving Ramsey Graphs. Comb. Probab. Comput. 21(4): 554-581 (2012) - [j220]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 A 119(6): 1200-1215 (2012) - [j219]Andrzej Dudek, Reshma Ramadurai, Vojtech Rödl:
On induced Folkman numbers. Random Struct. Algorithms 40(4): 493-500 (2012) - [j218]Vojtech Rödl, Mathias Schacht:
Complete Partite subgraphs in dense hypergraphs. Random Struct. Algorithms 41(4): 557-573 (2012) - [j217]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): 15-29 (2012) - [j216]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of Random Graphs. SIAM J. Discret. 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
- [j215]Andrzej Dudek, Vojtech Rödl:
On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers. Comb. 31(1): 39-53 (2011) - [j214]Domingos Dellamonica Jr., Vojtech Rödl:
Hereditary quasirandom properties of hypergraphs. Comb. 31(2): 165-182 (2011) - [j213]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) - [j212]Domingos Dellamonica Jr., Vojtech Rödl:
A note on Thomassenʼs conjecture. J. Comb. Theory B 101(6): 509-515 (2011) - [j211]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): 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
- [j210]Václav Koubek, Vojtech Rödl:
On the number of graphs with a given endomorphism monoid. Discret. Math. 310(3): 376-384 (2010) - [j209]Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers:
Note on robust critical graphs with large odd girth. Discret. Math. 310(3): 499-504 (2010) - [j208]Andrzej Dudek, Vojtech Rödl:
An almost quadratic bound on vertex Folkman numbers. J. Comb. Theory B 100(2): 132-140 (2010) - [j207]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory B 100(2): 151-160 (2010) - [j206]Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl:
Some constructive bounds on Ramsey numbers. J. Comb. Theory B 100(5): 439-445 (2010) - [j205]Alexandr V. Kostochka, Vojtech Rödl:
Constructions of sparse uniform hypergraphs with high chromatic number. Random Struct. Algorithms 36(1): 46-56 (2010) - [j204]Ehud Friedgut, Vojtech Rödl, Mathias Schacht:
Ramsey properties of random discrete structures. Random Struct. Algorithms 37(4): 407-436 (2010) - [j203]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
- [j202]Vojtech Rödl, Mathias Schacht:
Generalizations of the removal lemma. Comb. 29(4): 467-501 (2009) - [j201]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): 165-203 (2009) - [j200]Andrzej Dudek, Peter Frankl, Vojtech Rödl:
A Note on Universal and Canonically Coloured Sequences. Comb. Probab. Comput. 18(5): 683-689 (2009) - [j199]Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht:
On Colourings of Hypergraphs Without Monochromatic Fano Planes. Comb. Probab. Comput. 18(5): 803-818 (2009) - [j198]Andrzej Dudek, Esmeralda Nastase, Vojtech Rödl:
On k-chromatically connected graphs. Discret. Math. 309(18): 5547-5550 (2009) - [j197]Domingos Dellamonica Jr., Vojtech Rödl:
Hereditary quasi-random properties of hypergraphs. Electron. Notes Discret. Math. 34: 495-499 (2009) - [j196]Václav Koubek, Vojtech Rödl, Benjamin Shemmer:
Representing Subdirect Product Monoids by Graphs. Int. J. Algebra Comput. 19(5): 705-721 (2009) - [j195]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Comb. Theory A 116(3): 613-636 (2009) - [j194]Václav Koubek, Vojtech Rödl, Benjamin Shemmer:
On graphs with a given endomorphism monoid. J. 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
- [j193]Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski:
An approximate Dirac-type theorem for k -uniform hypergraphs. Comb. 28(2): 229-260 (2008) - [j192]Andrzej Dudek, Vojtech Rödl:
On the Turán Properties of Infinite Graphs. Electron. J. Comb. 15(1) (2008) - [j191]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Note on the 3-graph counting lemma. Discret. Math. 308(19): 4501-4517 (2008) - [j190]Andrzej Dudek, Vojtech Rödl:
On the Folkman Number f(2, 3, 4). Exp. Math. 17(1): 63-67 (2008) - [j189]Andrzej Dudek, Vojtech Rödl:
Finding Folkman Numbers via MAX CUT Problem. Electron. Notes Discret. Math. 30: 99-104 (2008) - [j188]Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl:
Colorful Flowers. Electron. Notes Discret. Math. 31: 255-258 (2008) - [j187]Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht:
On the Ramsey Number of Sparse 3-Graphs. Graphs Comb. 24(3): 205-228 (2008) - [j186]Jan Zich, Yoshiharu Kohayakawa, Vojtech Rödl, V. Sunderam:
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness. Internet Math. 5(3): 227-250 (2008) - [j185]Vojtech Rödl, Jan Zich:
Triangulations and the Hajós conjecture. J. Graph Theory 59(4): 293-325 (2008) - [j184]Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
An Algorithmic Version of the Hypergraph Regularity Method. SIAM J. Comput. 37(6): 1728-1776 (2008) - [j183]Vojtech Rödl, Mark H. Siggers:
On Ramsey Minimal Graphs. SIAM J. Discret. 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
- [j182]Vojtech Rödl, Mathias Schacht:
Regular Partitions of Hypergraphs: Regularity Lemmas. Comb. Probab. Comput. 16(6): 833-885 (2007) - [j181]Vojtech Rödl, Mathias Schacht:
Regular Partitions of Hypergraphs: Counting Lemmas. Comb. Probab. Comput. 16(6): 887-901 (2007) - [j180]Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger:
Small subsets inherit sparse epsilon-regularity. J. Comb. Theory B 97(1): 34-56 (2007) - [j179]Dhruv Mubayi, Vojtech Rödl:
On the chromatic number and independence number of hypergraph products. J. Comb. Theory B 97(1): 151-155 (2007) - [j178]Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot:
A note on the jumping constant conjecture of Erdös. J. Comb. Theory B 97(2): 204-216 (2007) - [j177]Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige:
Integer and fractional packings of hypergraphs. J. Comb. Theory B 97(2): 245-268 (2007) - [j176]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan:
Turán's theorem for pseudo-random graphs. J. Comb. Theory A 114(4): 631-657 (2007) - [j175]Christian Avart, Vojtech Rödl, Mathias Schacht:
Every Monotone 3-Graph Property is Testable. SIAM J. Discret. Math. 21(1): 73-92 (2007) - [j174]Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. Discret. 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 - [j173]Dhruv Mubayi, Vojtech Rödl:
Supersaturation For Ramsey-Turán Problems. Comb. 26(3): 315-332 (2006) - [j172]Noga Alon, Yoshiharu Kohayakawa, Christian Mauduit, Carlos Gustavo T. de A. Moreira, Vojtech Rödl:
Measures of Pseudorandomness for Finite Sequences: Minimal Values. Comb. Probab. Comput. 15(1-2): 1-29 (2006) - [j171]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
A Dirac-Type Theorem for 3-Uniform Hypergraphs. Comb. Probab. Comput. 15(1-2): 229-251 (2006) - [j170]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) - [j169]Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Short paths in quasi-random triple systems with sparse underlying graphs. J. Comb. Theory B 96(4): 584-607 (2006) - [j168]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 A 113(1): 67-83 (2006) - [j167]Vojtech Rödl, Eduardo Tengan:
A note on a conjecture by Füredi. J. Comb. Theory A 113(6): 1214-1218 (2006) - [j166]Alexandr V. Kostochka, Vojtech Rödl:
On Ramsey numbers of uniform hypergraphs with given maximum degree. J. Comb. Theory A 113(7): 1555-1564 (2006) - [j165]Vojtech Rödl, Mark H. Siggers:
Color critical hypergraphs with many edges. J. Graph Theory 53(1): 56-74 (2006) - [j164]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
The counting lemma for regular k-uniform hypergraphs. Random Struct. Algorithms 28(2): 113-179 (2006) - [j163]Vojtech Rödl, Jozef Skokan:
Applications of the regularity lemma for uniform hypergraphs. Random Struct. Algorithms 28(2): 180-194 (2006) - 2005
- [j162]Noga Alon, Vojtech Rödl:
Sharp Bounds For Some Multicolor Ramsey Numbers. Comb. 25(2): 125-141 (2005) - [j161]Mike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl:
Distance Graphs on the Integers. Comb. Probab. Comput. 14(1-2): 107-131 (2005) - [j160]Yuejian Peng, Vojtech Rödl, Jozef Skokan:
Counting Small Cliques in 3-uniform Hypergraphs. Comb. Probab. Comput. 14(3): 371-413 (2005) - [j159]Vojtech Rödl, Lubos Thoma:
On Cover Graphs and Dependent Arcs in Acyclic Orientations. Comb. Probab. Comput. 14(4): 585-617 (2005) - [j158]Christian Avart, Vojtech Rödl, Mathias Schacht:
Every Monotone 3-Graph Property is Testable. Electron. Notes Discret. Math. 22: 539-542 (2005) - [j157]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
- [j156]Alexandr V. Kostochka, Vojtech Rödl:
On Graphs With Small Ramsey Numbers, II. Comb. 24(3): 389-401 (2004) - [j155]Dhruv Mubayi, Vojtech Rödl:
Uniform Edge Distribution in Hypergraphs is Hereditary. Electron. J. Comb. 11(1) (2004) - [j154]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht:
The Turán Theorem for Random Graphs. Comb. Probab. Comput. 13(1): 61-91 (2004) - [j153]Vojtech Rödl, Jozef Skokan:
Regularity Lemma for k-uniform hypergraphs. Random Struct. Algorithms 25(1): 1-42 (2004) - 2003
- [j152]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl:
Hereditary Properties Of Triple Systems. Comb. Probab. Comput. 12(2): 155-189 (2003) - [j151]Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali:
Ramsey Games Against a One-Armed Bandit. Comb. Probab. Comput. 12(5-6): 515-545 (2003) - [j150]Vojtech Rödl:
On homogeneous sets of positive integers. J. Comb. Theory A 102(1): 229-240 (2003) - [j149]David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl:
Independent Deuber sets in graphs on the natural numbers. J. Comb. Theory A 103(2): 305-322 (2003) - [j148]Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
Integer and fractional packings in dense 3-uniform hypergraphs. Random Struct. Algorithms 22(3): 248-310 (2003) - [j147]Yoshiharu Kohayakawa, Vojtech Rödl:
Regular pairs in sparse random graphs I. Random Struct. Algorithms 22(4): 359-434 (2003) - [j146]Brendan Nagle, Vojtech Rödl:
Regularity properties for triple systems. Random Struct. Algorithms 23(3): 264-332 (2003) - [j145]Richard A. Duke, Paul Erdös, Vojtech Rödl:
On large intersecting subfamilies of uniform setfamilies. Random Struct. Algorithms 23(4): 351-356 (2003) - [j144]Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma:
An Optimal Algorithm for Checking Regularity. SIAM J. Comput. 32(5): 1210-1235 (2003) - 2002
- [j143]Yuejian Peng, Vojtech Rödl, Andrzej Rucinski:
Holes in Graphs. Electron. J. Comb. 9(1) (2002) - [j142]Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Ramsey Properties of Families of Graphs. J. Comb. Theory B 86(2): 413-419 (2002) - [j141]Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan:
Hypergraphs, Quasi-randomness, and Conditions for Regularity. J. Comb. Theory A 97(2): 307-352 (2002) - [j140]Dhruv Mubayi, Vojtech Rödl:
On the Turán Number of Triple Systems. J. Comb. Theory A 100(1): 136-152 (2002) - [j139]Peter Frankl, Vojtech Rödl:
Extremal problems on set systems. Random Struct. Algorithms 20(2): 131-164 (2002) - [j138]Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
On characterizing hypergraph regularity. Random Struct. Algorithms 21(3-4): 293-335 (2002) - [c13]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl:
Efficient Testing of Hypergraphs. ICALP 2002: 1017-1028 - [c12]Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma:
An optimal algorithm for checking regularity (extended abstract). SODA 2002: 277-286 - 2001
- [j137]Penny E. Haxell, Vojtech Rödl:
Integer and Fractional Packings in Dense Graphs. Comb. 21(1): 13-38 (2001) - [j136]Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
On Bipartite Graphs with Linear Ramsey Numbers. Comb. 21(2): 199-209 (2001) - [j135]Brendan Nagle, Vojtech Rödl:
The asymptotic number of triple systems not containing a fixed one. Discret. Math. 235(1-3): 271-290 (2001) - [j134]David S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl:
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers. J. Comb. Theory A 93(1): 1-17 (2001) - [j133]Alexandr V. Kostochka, Vojtech Rödl:
On graphs with small Ramsey numbers. J. Graph Theory 37(4): 198-204 (2001) - [j132]Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali:
On the chromatic number of set systems. Random Struct. Algorithms 19(2): 87-98 (2001) - [j131]Vojtech Rödl, Andrzej Rucinski, Michelle Wagner:
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma. SIAM J. Comput. 31(2): 428-446 (2001) - [c11]Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Near-optimum Universal Graphs for Graphs with Bounded Degrees. RANDOM-APPROX 2001: 170-180 - 2000
- [j130]Vojtech Rödl, Endre Szemerédi:
On Size Ramsey Numbers of Graphs with Bounded Degree. Comb. 20(2): 257-262 (2000) - [j129]Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
On graphs with linear Ramsey numbers. J. Graph Theory 35(3): 176-192 (2000) - [j128]Andrzej Czygrinow, Vojtech Rödl:
An Algorithmic Regularity Lemma for Hypergraphs. SIAM J. Comput. 30(4): 1041-1066 (2000) - [c10]Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Universality and Tolerance. FOCS 2000: 14-21 - [c9]Yoshiharu Kohayakawa, Vojtech Rödl:
Algorithmic Aspects of Regularity. LATIN 2000: 1-17 - [c8]Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan:
Equivalent Conditions for Regularity (Extended Abstract). LATIN 2000: 48-57
1990 – 1999
- 1999
- [j127]Vojtech Rödl, Andrzej Rucinski:
Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma. Comb. 19(3): 437-452 (1999) - [j126]Vojtech Rödl, Andrzej Rucinski, Anusch Taraz:
Hypergraph Packing And Graph Embedding. Comb. Probab. Comput. 8(4): 363-376 (1999) - [j125]David S. Gunderson, Vojtech Rödl, Alexander F. Sidorenko:
Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs. J. Comb. Theory A 88(2): 342-367 (1999) - [j124]Hans Jürgen Prömel, Vojtech Rödl:
Non-Ramsey Graphs Are c log n-Universal. J. Comb. Theory A 88(2): 379-384 (1999) - [j123]Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl:
Constructive Quasi-Ramsey Numbers and Tournament Ranking. SIAM J. Discret. Math. 12(1): 48-63 (1999) - 1998
- [j122]Alexandr V. Kostochka, Vojtech Rödl:
On Large Systems of Sets with No Large Weak <Delta>-subsystems. Comb. 18(2): 235-240 (1998) - [j121]Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl:
Induced Ramsey Numbers. Comb. 18(3): 373-404 (1998) - [j120]Noga Alon, Vojtech Rödl, Andrzej Rucinski:
Perfect Matchings in ε-regular Graphs. Electron. J. Comb. 5 (1998) - [j119]Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Endomorphisms of Partially Ordered Sets. Comb. Probab. Comput. 7(1): 33-46 (1998) - [j118]David S. Gunderson, Vojtech Rödl:
Extremal Problems for Affine Cubes of Integers. Comb. Probab. Comput. 7(1): 65-79 (1998) - [j117]Tomasz Luczak, Vojtech Rödl, Endre Szemerédi:
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. Comb. Probab. Comput. 7(4): 423-436 (1998) - [j116]Tomasz Luczak, Vojtech Rödl, Tomasz Schoen:
Independent finite sums in graphs defined on the natural numbers. Discret. Math. 181(1-3): 289-294 (1998) - [j115]Vojtech Rödl, Andrzej Rucinski:
Ramsey Properties of Random Hypergraphs. J. Comb. Theory A 81(1): 1-33 (1998) - [j114]Alexandr V. Kostochka, Vojtech Rödl:
Partial Steiner systems and matchings in hypergraphs. Random Struct. Algorithms 13(3-4): 335-347 (1998) - [c7]Vojtech Rödl, Andrzej Rucinski, Michelle Wagner:
An Algorithmic Embedding of Graphs via Perfect Matchings. RANDOM 1998: 25-34 - 1997
- [j113]Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl:
On K4-Free Subgraphs of Random Graphs. Comb. 17(2): 173-213 (1997) - [j112]Vojtech Rödl, Andrzej Rucinski:
Bipartite Coverings of Graphs. Comb. Probab. Comput. 6(3): 349-352 (1997) - [j111]Norbert Sauer, Robert E. Woodrow, Vojtech Rödl:
Chromatic Ramsey Theory. Eur. J. Comb. 18(1): 93-102 (1997) - [j110]Vojtech Rödl, Lubos Thoma:
On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems. J. Comb. Theory A 80(1): 166-173 (1997) - [j109]Vojtech Rödl, Beata Wysocka:
Note on regular subgraphs. J. Graph Theory 24(2): 139-154 (1997) - [j108]Pavel Pudlák, Vojtech Rödl, Jirí Sgall:
Boolean Circuits, Tensor Ranks, and Communication Complexity. SIAM J. Comput. 26(3): 605-633 (1997) - 1996
- [j107]Nancy Eaton, Vojtech Rödl:
Graphs of Small Dimensions. Comb. 16(1): 59-85 (1996) - [j106]Hal A. Kierstead, Vojtech Rödl:
Applications of hypergraph coloring to coloring graphs not inducing certain trees. Discret. Math. 150(1-3): 187-193 (1996) - [j105]Tomasz Luczak, Vojtech Rödl:
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree. J. Comb. Theory B 66(2): 324-333 (1996) - [j104]Hanno Lefmann, Vojtech Rödl, Beata Wysocka:
Multicolored Subsets in Colored Hypergraphs. J. Comb. Theory A 74(2): 209-248 (1996) - [j103]Nancy Eaton, Ronald J. Gould, Vojtech Rödl:
On p-intersection representations. J. Graph Theory 21(4): 377-392 (1996) - [j102]Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl:
Ramsey-type results for oriented trees. J. Graph Theory 22(1): 1-8 (1996) - [j101]Vojtech Rödl, Lubos Thoma:
Asymptotic packing and the random greedy algorithm. Random Struct. Algorithms 8(3): 161-177 (1996) - [c6]Claudia Bertram-Kretzberg, Hanno Lefmann, Vojtech Rödl, Beata Wysocka:
Proper Bounded Edge-Colorings. DMTCS 1996: 121-130 - 1995
- [j100]Hanno Lefmann, Vojtech Rödl:
On Erdös-Rado Numbers. Comb. 15(1): 85-104 (1995) - [j99]David A. Grable, Kevin T. Phelps, Vojtech Rödl:
The Minimum Independence Number for Designs. Comb. 15(2): 175-185 (1995) - [j98]Vojtech Rödl, Norbert Sauer, Xuding Zhu:
Ramsey Families which Exclude a Graph. Comb. 15(4): 589-596 (1995) - [j97]Dwight Duffus, Hanno Lefmann, Vojtech Rödl:
Shift graphs and lower bounds on Ramsey numbers rk(l; r). Discret. Math. 137(1-3): 177-187 (1995) - [j96]László Pyber, Vojtech Rödl, Endre Szemerédi:
Dense Graphs without 3-Regular Subgraphs. J. Comb. Theory B 63(1): 41-54 (1995) - [j95]Vojtech Rödl, Alexander F. Sidorenko:
On the Jumping Constant Conjecture for Multigraphs. J. Comb. Theory A 69(2): 347-357 (1995) - [j94]Jirí Matousek, Vojtech Rödl:
On Ramsey Sets in Spheres. J. Comb. Theory A 70(1): 30-44 (1995) - [j93]Vojtech Rödl, Robin Thomas:
On the Genus of a Random Graph. Random Struct. Algorithms 6(1): 1-12 (1995) - [j92]Richard A. Duke, Hanno Lefmann, Vojtech Rödl:
On Uncrowded Hypergraphs. Random Struct. Algorithms 6(2/3): 209-212 (1995) - [j91]Paul Erdös, Vojtech Rödl:
Covering of r-Graphs by Complete r-Partite Subgraphs. Random Struct. Algorithms 6(2/3): 319-322 (1995) - [j90]Dwight Duffus, Mark Ginn, Vojtech Rödl:
On the Computational Complexity of Ordered Subgraph Recognition. Random Struct. Algorithms 7(3): 223-268 (1995) - [j89]Richard A. Duke, Hanno Lefmann, Vojtech Rödl:
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph. SIAM J. Comput. 24(3): 598-620 (1995) - 1994
- [j88]Pavel Pudlák, Vojtech Rödl:
Some combinatorial-algebraic problems from complexity theory. Discret. Math. 136(1-3): 253-279 (1994) - [j87]Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster:
The Algorithmic Aspects of the Regularity Lemma. J. Algorithms 16(1): 80-109 (1994) - [j86]Richard A. Duke, Vojtech Rödl:
The Erdös-Ko-Rado Theorem for Small Families. J. Comb. Theory A 65(2): 246-251 (1994) - [j85]Lucien Haddad, Vojtech Rödl:
Unbalanced Steiner Triple Systems. J. Comb. Theory A 66(1): 1-16 (1994) - [j84]Vojtech Rödl, Edita Sinajová:
Note on Independent Sets in Steiner Systems. Random Struct. Algorithms 5(1): 183-190 (1994) - [j83]Vojtech Rödl, Andrzej Rucinski:
Random Graphs with Monochromatic Triangles in Every Edge Coloring. Random Struct. Algorithms 5(2): 253-270 (1994) - 1993
- [j82]Frantisek Franek, Vojtech Rödl:
2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs. Discret. Math. 114(1-3): 199-203 (1993) - [j81]Ronald J. Gould, Vojtech Rödl:
On isomorphic subgraphs. Discret. Math. 118(1-3): 259-262 (1993) - [j80]Hanno Lefmann, Vojtech Rödl:
On Canonical Ramsey Numbers for Complete Graphs versus Paths. J. Comb. Theory B 58(1): 1-13 (1993) - [j79]Vojtech Rödl, Bernd Voigt:
Monochromatic Trees with Respect to Edge Partitions. J. Comb. Theory B 58(2): 291-298 (1993) - [j78]David S. Gunderson, Vojtech Rödl, Norbert W. Sauer:
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs. J. Comb. Theory B 59(2): 199-209 (1993) - [j77]Hanno Lefmann, Kevin T. Phelps, Vojtech Rödl:
Rigid Linear Binary Codes. J. Comb. Theory A 63(1): 110-128 (1993) - [c5]Pavel Pudlák, Vojtech Rödl:
Modified ranks of tensors and the size of circuits. STOC 1993: 523-531 - 1992
- [j76]Pavel Pudlák, Vojtech Rödl:
A combinatorial approach to complexity. Comb. 12(2): 221-226 (1992) - [j75]Jaroslav Nesetril, Vojtech Rödl:
On Ramsey graphs without bipartite subgraphs. Discret. Math. 101(1-3): 223-229 (1992) - [j74]Jan Pelant, Vojtech Rödl:
On coverings of infinite- dimentional metric spaces. Discret. Math. 108(1-3): 75-81 (1992) - [j73]Richard A. Duke, Paul Erdös, Vojtech Rödl:
Cycle-connected graphs. Discret. Math. 108(1-3): 261-278 (1992) - [j72]Frantisek Franek, Vojtech Rödl:
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs. Graphs Comb. 8(4): 299-308 (1992) - [j71]Peter Frankl, Vojtech Rödl:
The Uniformity Lemma for hypergraphs. Graphs Comb. 8(4): 309-312 (1992) - [j70]Hanno Lefmann, Vojtech Rödl, Robin Thomas:
Monochromatic Vs multicolored paths. Graphs Comb. 8(4): 323-332 (1992) - [j69]Jan Reiterman, Vojtech Rödl, Edita Sinajová:
On embedding of graphs into euclidean spaces of small dimension. J. Comb. Theory B 56(1): 1-8 (1992) - [j68]Vojtech Rödl, Zsolt Tuza:
Rainbow Subgraphs in Properly Edge-colored Graphs. Random Struct. Algorithms 3(2): 175-182 (1992) - [j67]Nancy Eaton, Vojtech Rödl:
A Canonical Ramsey Theorem. Random Struct. Algorithms 3(4): 427-444 (1992) - [c4]Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster:
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract). FOCS 1992: 473-481 - 1991
- [j66]Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler:
The number of t-wise balance designs. Comb. 11(3): 207-218 (1991) - [j65]Jason I. Brown, Vojtech Rödl:
A ramsey type problem concerning vertex colourings. J. Comb. Theory B 52(1): 45-52 (1991) - 1990
- [j64]Vojtech Rödl:
On ramsey families of sets. Graphs Comb. 6(2): 187-195 (1990) - [j63]Hiroshi Maehara, Vojtech Rödl:
On the dimension to represent a graph by a unit distance graph. Graphs Comb. 6(4): 365-367 (1990) - [j62]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
Iterated combinatorial density theorems. J. Comb. Theory A 54(1): 95-111 (1990) - [j61]László Babai, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi:
Lower Bounds to the Complexity of Symmetric Boolean Functions. Theor. Comput. Sci. 74(3): 313-323 (1990)
1980 – 1989
- 1989
- [j60]Jan Reiterman, Vojtech Rödl, Edita Sinajová:
Embeddings of Graphs in Euclidean Spaces. Discret. Comput. Geom. 4: 349-364 (1989) - [j59]Jan Reiterman, Vojtech Rödl, Edita Sinajová:
Geometrical embeddings of graphs. Discret. Math. 74(3): 291-319 (1989) - [j58]Jaroslav Nesetril, Vojtech Rödl:
The partite construction and ramsey set systems. Discret. Math. 75(1-3): 327-334 (1989) - [j57]Charles J. Colbourn, Vojtech Rödl:
Percentages in pairwise balanced designs. Discret. Math. 77(1-3): 57-63 (1989) - [j56]Jaroslav Nesetril, Vojtech Rödl:
Chromatically optimal rigid graphs. J. Comb. Theory B 46(2): 133-141 (1989) - [j55]Vojtech Rödl, Peter Winkler:
A Ramsey-Type Theorem for Orderings of a Graph. SIAM J. Discret. Math. 2(3): 402-406 (1989) - 1988
- [j54]Pavel Pudlák, Vojtech Rödl, Petr Savický:
Graph Complexity. Acta Informatica 25(5): 515-535 (1988) - [j53]Peter Frankl, Vojtech Rödl:
Some Ramsey - Turán type results for hypergraphs. Comb. 8(4): 323-332 (1988) - [j52]Hiroshi Maehara, Jan Reiterman, Vojtech Rödl, Edita Sinajová:
Embedding of trees in euclidean spaces. Graphs Comb. 4(1): 43-47 (1988) - [j51]Peter Frankl, Vojtech Rödl, Richard M. Wilson:
The number of submatrices of a given type in a Hadamard matrix and related results. J. Comb. Theory B 44(3): 317-328 (1988) - [j50]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
Quantitative theorems for regular systems of equations. J. Comb. Theory A 47(2): 246-261 (1988) - [j49]Svatopluk Poljak, Vojtech Rödl, Joel Spencer:
Tournament Ranking with Expected Profit in Polynomial Time. SIAM J. Discret. Math. 1(3): 372-376 (1988) - 1987
- [j48]Vojtech Rödl, William T. Trotter:
A note on ranking functions. Discret. Math. 67(3): 307-309 (1987) - [j47]Vojtech Rödl:
Small Spaces with Large Point Character. Eur. J. Comb. 8(1): 55-58 (1987) - [j46]Vojtech Rödl, Craig A. Tovey:
Multiple Optima in Local Search. J. Algorithms 8(2): 250-259 (1987) - [j45]András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza:
Local k-colorings of graphs and hypergraphs. J. Comb. Theory B 43(2): 127-139 (1987) - [j44]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
Induced restricted Ramsey theorems for spaces. J. Comb. Theory A 44(1): 120-128 (1987) - [j43]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
On subsets of abelian groups with no 3-term arithmetic progression. J. Comb. Theory A 45(1): 157-161 (1987) - 1986
- [j42]Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress:
Coloring graphs with locally few colors. Discret. Math. 59(1-2): 21-34 (1986) - [j41]Vojtech Rödl:
On universality of graphs with uniformly distributed edges. Discret. Math. 59(1-2): 125-134 (1986) - [j40]Péter Komjáth, Vojtech Rödl:
Coloring of universal graphs. Graphs Comb. 2(1): 55-60 (1986) - [j39]Paul Erdös, Peter Frankl, Vojtech Rödl:
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Comb. 2(1): 113-121 (1986) - [j38]Peter Frankl, Vojtech Rödl:
Large triangle-free subgraphs in graphs withoutK4. Graphs Comb. 2(1): 135-144 (1986) - [j37]Jaroslav Nesetril, Vojtech Rödl:
On sets of integers with the Schur property. Graphs Comb. 2(1): 269-275 (1986) - [j36]Jaroslav Nesetril, Vojtech Rödl:
Finite union theorem with restrictions. Graphs Comb. 2(1): 357-361 (1986) - [j35]Hans Jürgen Prömel, Vojtech Rödl:
An elementary proof of the canonizing version of Gallai-Witt's theorem. J. Comb. Theory A 42(1): 144-149 (1986) - [j34]David Preiss, Vojtech Rödl:
Note on decomposition of spheres in Hilbert spaces. J. Comb. Theory A 43(1): 38-44 (1986) - [c3]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:
Two lower bounds for branching programs. STOC 1986: 30-38 - 1985
- [j33]Stefan A. Burr, Jaroslav Nesetril, Vojtech Rödl:
On the use of senders in generalized ramsey theory for graphs. Discret. Math. 54(1): 1-13 (1985) - [j32]Jan Reiterman, Vojtech Rödl, Edita Sinajová, Miroslav Tuma:
Threshold hypergraphs. Discret. Math. 54(2): 193-200 (1985) - [j31]Jaroslav Nesetril, Vojtech Rödl:
Two remarks on Ramsey's theorem. Discret. Math. 54(3): 339-341 (1985) - [j30]Vojtech Rödl:
On a Packing and Covering Problem. Eur. J. Comb. 6(1): 69-78 (1985) - [j29]Peter Frankl, Vojtech Rödl:
Near Perfect Coverings in Graphs and Hypergraphs. Eur. J. Comb. 6(4): 317-326 (1985) - [j28]Vojtech Rödl, Richard A. Duke:
On graphs with small subgraphs of large chromatic number. Graphs Comb. 1(1): 91-96 (1985) - [j27]Peter Frankl, Vojtech Rödl:
Lower bounds for Turán's problem. Graphs Comb. 1(1): 213-216 (1985) - [j26]Vojtech Rödl:
Note on a Ramsey-Turán type problem. Graphs Comb. 1(1): 291-293 (1985) - [j25]Vojtech Rödl, Zsolt Tuza:
On color critical graphs. J. Comb. Theory B 38(3): 204-213 (1985) - [j24]Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt:
Canonizing Ordering Theorems for Hales Jewett Structures. J. Comb. Theory A 40(2): 394-408 (1985) - [c2]Noga Alon, Peter Frankl, Vojtech Rödl:
Geometrical Realization of Set Systems and Probabilistic Communication Complexity. FOCS 1985: 277-280 - 1984
- [j23]Jaroslav Nesetril, Vojtech Rödl:
Sparse Ramsey graphs. Comb. 4(1): 71-78 (1984) - [j22]Kevin T. Phelps, Vojtech Rödl:
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems. Comb. 4(1): 79-88 (1984) - [j21]Peter Frankl, Vojtech Rödl:
Hypergraphs do not jump. Comb. 4(2): 149-159 (1984) - [j20]Vojtech Rödl:
On combinatorial properties of spheres in eulidean spaces. Comb. 4(4): 345-349 (1984) - [j19]Václav Koubek, Vojtech Rödl:
On the minimum order of graphs with given semigroup. J. Comb. Theory B 36(2): 135-155 (1984) - 1983
- [j18]Svatopluk Poljak, Ales Pultr, Vojtech Rödl:
On qualitatively independent partitions and related problems. Discret. Appl. Math. 6(2): 193-205 (1983) - [j17]Vojtech Rödl:
On a problem in combinatorial geometry. Discret. Math. 45(1): 129-131 (1983) - [j16]Jaroslav Nesetril, Vojtech Rödl:
Another Proof of the Folkman-Rado-Sanders Theorem. J. Comb. Theory A 34(1): 108-109 (1983) - [j15]Jaroslav Nesetril, Vojtech Rödl:
Ramsey Classes of Set Systems. J. Comb. Theory A 34(2): 183-201 (1983) - [j14]C. Chvatál, Vojtech Rödl, Endre Szemerédi, William T. Trotter:
The Ramsey number of a graph with bounded maximum degree. J. Comb. Theory B 34(3): 239-243 (1983) - [j13]Svatopluk Poljak, Vojtech Rödl, Ales Pultr:
On a product dimension of bipartite graphs. J. Graph Theory 7(4): 475-486 (1983) - 1982
- [j12]Vladimír Müller, Vojtech Rödl:
Monotone paths in ordered graphs. Comb. 2(2): 193-201 (1982) - [j11]Vojtech Rödl:
Nearly bipartite graphs with large chromatic number. Comb. 2(4): 377-383 (1982) - [j10]Charles J. Colbourn, Marlene J. Colbourn, Kevin T. Phelps, Vojtech Rödl:
Colouring steiner quadruple systems. Discret. Appl. Math. 4(2): 103-111 (1982) - [j9]Pavel Pudlák, Vojtech Rödl:
Partition theorems for systems of finite subsets of integers. Discret. Math. 39(1): 67-73 (1982) - [j8]Jaroslav Nesetril, Vojtech Rödl:
Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs. Eur. J. Comb. 3(4): 347-352 (1982) - 1981
- [j7]Jaroslav Nesetril, Vojtech Rödl:
Simple proof of the existence of restricted Ramsey graphs by means of a partite construction. Comb. 1(2): 199-202 (1981) - [j6]Svatopluk Poljak, Vojtech Rödl, Daniel Turzík:
Complexity of representation of graphs by set systems. Discret. Appl. Math. 3(4): 301-312 (1981) - [j5]Svatopluk Poljak, Vojtech Rödl:
On set systems determined by intersections. Discret. Math. 34(2): 173-184 (1981) - [j4]Svatopluk Poljak, Vojtech Rödl:
On the arc-chromatic number of a digraph. J. Comb. Theory B 31(2): 190-198 (1981) - [c1]Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl:
Fast Recognition of Rings and Lattices. FCT 1981: 137-145
1970 – 1979
- 1979
- [j3]Jaroslav Nesetril, Vojtech Rödl:
A short proof of the existence of highly chromatic hypergraphs without short cycles. J. Comb. Theory B 27(2): 225-227 (1979) - 1978
- [j2]Jaroslav Nesetril, Vojtech Rödl:
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph. Discret. Math. 23(1): 49-55 (1978) - 1977
- [j1]Jaroslav Nesetril, Vojtech Rödl:
Partitions of Finite Relational and Set Systems. J. Comb. Theory A 22(3): 289-312 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 00:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
