| Year |
Citation |
Score |
| 2018 |
Hàn H, Rödl V, Szabó T. Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs Siam Journal On Discrete Mathematics. 32: 826-838. DOI: 10.1137/17M1116696 |
0.45 |
|
| 2018 |
Kohayakawa Y, Retter T, Rödl V. The size Ramsey number of short subdivisions of bounded degree graphs Random Structures & Algorithms. 54: 304-339. DOI: 10.1002/rsa.20783 |
0.404 |
|
| 2017 |
Rödl V, Ruciński A, Schacht M. Ramsey properties of random graphs and Folkman numbers Discussiones Mathematicae Graph Theory. 37: 755. DOI: 10.7151/Dmgt.1971 |
0.687 |
|
| 2017 |
Dellamonica D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of Bh-sets of a given cardinality Proceedings of the London Mathematical Society. 116: 629-669. DOI: 10.1112/Plms.12082 |
0.732 |
|
| 2017 |
Reiher C, Rödl V, Schacht M. Hypergraphs with vanishing Turán density in uniformly dense hypergraphs Journal of the London Mathematical Society. 97: 77-97. DOI: 10.1112/Jlms.12095 |
0.487 |
|
| 2017 |
DUFFUS D, KAY B, RÖDL V. The Minimum Number of Edges in Uniform Hypergraphs with Property O Combinatorics, Probability and Computing. 27: 531-538. DOI: 10.1017/S096354831700058X |
0.398 |
|
| 2017 |
Avart C, Kay B, Reiher C, Rödl V. The chromatic number of finite type-graphs Journal of Combinatorial Theory, Series B. 122: 877-896. DOI: 10.1016/J.Jctb.2016.10.004 |
0.849 |
|
| 2017 |
Nešetřil J, Rödl V. Ramsey Partial Orders from Acyclic Graphs Order. 35: 293-300. DOI: 10.1007/s11083-017-9433-4 |
0.405 |
|
| 2017 |
Rödl V, Ruciński A, Schacht M, Szemerédi E. On the Hamiltonicity of Triple Systems with High Minimum Degree Annals of Combinatorics. 21: 95-117. DOI: 10.1007/S00026-017-0345-1 |
0.541 |
|
| 2017 |
Nagle B, Rödl V, Schacht M. An algorithmic hypergraph regularity lemma Random Structures & Algorithms. 52: 301-353. DOI: 10.1002/rsa.20739 |
0.505 |
|
| 2017 |
Dudek A, Fleur SL, Mubayi D, Rödl V. On the Size-Ramsey Number of Hypergraphs Journal of Graph Theory. 86: 104-121. DOI: 10.1002/Jgt.22115 |
0.71 |
|
| 2016 |
Dellamonica D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. On the Number of Bh-Sets Combinatorics Probability and Computing. 25: 108-129. DOI: 10.1017/S0963548315000206 |
0.74 |
|
| 2016 |
Reiher C, Rödl V, Schacht M. Embedding tetrahedra into quasirandom hypergraphs Journal of Combinatorial Theory, Series B. 121: 229-247. DOI: 10.1016/J.Jctb.2016.06.008 |
0.554 |
|
| 2016 |
Messuti S, Rödl V, Schacht M. Packing minor-closed families of graphs into complete graphs Journal of Combinatorial Theory. Series B. 119: 245-265. DOI: 10.1016/J.Jctb.2016.03.003 |
0.695 |
|
| 2016 |
Dellamonica D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of B3-sets of a given cardinality Journal of Combinatorial Theory. Series A. 142: 44-76. DOI: 10.1016/J.Jcta.2016.03.004 |
0.789 |
|
| 2016 |
Kohayakawa Y, Rödl V, Schacht M. Discrepancy and eigenvalues of Cayley graphs Czechoslovak Mathematical Journal. 66: 941-954. DOI: 10.1007/S10587-016-0302-X |
0.691 |
|
| 2016 |
Rödl V, Ruciński A, Schacht M. An exponential-type upper bound for Folkman numbers Combinatorica. 1-18. DOI: 10.1007/S00493-015-3298-1 |
0.633 |
|
| 2016 |
Lauria M, Pudlák P, Rödl V, Thapen N. The complexity of proving that a graph is Ramsey Combinatorica. 37: 253-268. DOI: 10.1007/s00493-015-3193-9 |
0.398 |
|
| 2016 |
Horn P, Koubek V, Rödl V. Isomorphic edge disjoint subgraphs of hypergraphs Random Structures & Algorithms. 48: 767-793. DOI: 10.1002/Rsa.20635 |
0.405 |
|
| 2015 |
Zich J, Kohayakawa Y, Rödl V, Sunderam V. JumpNet: Improving connectivity and robustness in unstructured P2P networks by randomness Internet Mathematics. 5: 227-250. DOI: 10.1080/15427951.2008.10129165 |
0.747 |
|
| 2015 |
Dellamonica D, Kalyanasundaram S, Martin DM, Rödl V, Shapira A. An optimal algorithm for finding frieze-kannan regular partitions Combinatorics Probability and Computing. 24: 407-437. DOI: 10.1017/S0963548314000200 |
0.829 |
|
| 2015 |
Hàn H, Retter T, Rödl V, Schacht M. Ramsey-type numbers involving graphs and hypergraphs with large girth Electronic Notes in Discrete Mathematics. 50: 457-463. DOI: 10.1016/J.Endm.2015.07.076 |
0.682 |
|
| 2015 |
Messuti S, Rödl V, Schacht M. Packing minor closed families of graphs Electronic Notes in Discrete Mathematics. 49: 651-659. DOI: 10.1016/J.Endm.2015.06.088 |
0.691 |
|
| 2015 |
Dellamonica D, La Fleur S, Rödl V. On induced ramsey numbers for k-uniform hypergraphs Random Structures and Algorithms. DOI: 10.1002/Rsa.20580 |
0.752 |
|
| 2015 |
Dellamonica D, Kohayakawa Y, Rödl V, Ruciński A. An improved upper bound on the density of universal random graphs Random Structures and Algorithms. 46: 274-299. DOI: 10.1002/Rsa.20545 |
0.829 |
|
| 2014 |
Avart C, Luczak T, Rödl V. On generalized shift graphs Fundamenta Mathematicae. 226: 173-199. DOI: 10.4064/Fm226-2-6 |
0.845 |
|
| 2014 |
Horn P, Milans KG, Rödl V. Degree Ramsey Numbers of Closed Blowups of Trees The Electronic Journal of Combinatorics. 21. DOI: 10.37236/2526 |
0.441 |
|
| 2014 |
Dudek A, Retter T, Rödl V. On generalized Ramsey umbers of Erdos and Rogers Journal of Combinatorial Theory. Series B. 109: 213-227. DOI: 10.1016/J.Jctb.2014.06.006 |
0.59 |
|
| 2013 |
Dudek A, Frankl P, Rödl V. Some recent results on Ramsey-type numbers Discrete Applied Mathematics. 161: 1197-1202. DOI: 10.1016/J.Dam.2010.09.005 |
0.642 |
|
| 2013 |
Duffus D, Frankl P, Rödl V. Maximal independent sets in the covering graph of the cube Discrete Applied Mathematics. 161: 1203-1208. DOI: 10.1016/j.dam.2010.09.003 |
0.432 |
|
| 2013 |
Avart C, Komjáth P, Rödl V. Note on the point character of l 1-spaces Periodica Mathematica Hungarica. 66: 181-192. DOI: 10.1007/S10998-013-8845-1 |
0.752 |
|
| 2013 |
Lauria M, Pudlák P, Rödl V, Thapen N. The complexity of proving that a graph is Ramsey Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7965: 684-695. DOI: 10.1007/S00493-015-3193-9 |
0.575 |
|
| 2012 |
Dellamonica D, Haxell P, Luczak T, Mubayi D, Nagle B, Person Y, Rödl V, Schacht M. Tree-minimal graphs are almost regular Journal of Combinatorics. 3: 49-62. DOI: 10.4310/Joc.2012.V3.N1.A2 |
0.835 |
|
| 2012 |
Dellamonica D, Kalyanasundaram S, Martin D, Rödl V, Shapira A. A deterministic algorithm for the frieze-kannan regularity lemma Siam Journal On Discrete Mathematics. 26: 15-29. DOI: 10.1137/110846373 |
0.756 |
|
| 2012 |
Dellamonica D, Kohayakawa Y, Rödl V, Rucínski A. Universality of random graphs Siam Journal On Discrete Mathematics. 26: 353-374. DOI: 10.1137/10079882X |
0.82 |
|
| 2012 |
Dellamonica D, Rödl V. Distance preserving ramsey graphs Combinatorics Probability and Computing. 21: 554-581. DOI: 10.1017/S096354831200003X |
0.803 |
|
| 2012 |
Dellamonica D, Haxell P, Łuczak T, Mubayi D, Nagle B, Person Y, Rödl V, Schacht M, Verstraëte J. On even-degree subgraphs of linear hypergraphs Combinatorics Probability and Computing. 21: 113-127. DOI: 10.1017/S0963548311000575 |
0.794 |
|
| 2012 |
FRANKL P, RÖDL V, RUCIŃSKI A. On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size Combinatorics, Probability and Computing. 21: 141-148. DOI: 10.1017/S0963548311000496 |
0.46 |
|
| 2012 |
Alon N, Frankl P, Huang H, Rödl V, Ruciński A, Sudakov B. Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels Journal of Combinatorial Theory, Series A. 119: 1200-1215. DOI: 10.1016/J.Jcta.2012.02.004 |
0.408 |
|
| 2012 |
Rödl V, Schacht M. Complete Partite subgraphs in dense hypergraphs Random Structures and Algorithms. 41: 557-573. DOI: 10.1002/Rsa.20441 |
0.705 |
|
| 2012 |
Dudek A, Ramadurai R, Rödl V. On induced Folkman numbers Random Structures and Algorithms. 40: 493-500. DOI: 10.1002/Rsa.20397 |
0.666 |
|
| 2011 |
Dellamonica D, Rödl V. A note on Thomassen's conjecture Journal of Combinatorial Theory. Series B. 101: 509-515. DOI: 10.1016/J.Jctb.2011.04.002 |
0.795 |
|
| 2011 |
Dellamonica D, Rödl V. Hereditary quasirandom properties of hypergraphs Combinatorica. 31: 165-182. DOI: 10.1016/J.Endm.2009.07.082 |
0.808 |
|
| 2011 |
Duffus D, Frankl P, Rödl V. Maximal independent sets in bipartite graphs obtained from Boolean lattices European Journal of Combinatorics. 32: 1-9. DOI: 10.1016/j.ejc.2010.08.004 |
0.429 |
|
| 2011 |
Rödl V, Ruciński A, Szemerédi E. Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs Advances in Mathematics. 227: 1225-1299. DOI: 10.1016/J.Aim.2011.03.007 |
0.443 |
|
| 2011 |
Kohayakawa Y, Rödl V, Schacht M, Szemerédi E. Sparse partition universal graphs for graphs of bounded degree Advances in Mathematics. 226: 5041-5065. DOI: 10.1016/J.Aim.2011.01.004 |
0.722 |
|
| 2011 |
Dudek A, Rödl V. On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers Combinatorica. 31: 39-53. DOI: 10.1007/S00493-011-2626-3 |
0.625 |
|
| 2011 |
Dellamonica D, Koubek V, Martin DM, Rödl V. On a conjecture of Thomassen concerning subgraphs of large girth Journal of Graph Theory. 67: 316-331. DOI: 10.1002/Jgt.20534 |
0.831 |
|
| 2010 |
Alon N, Coja-Oghlan A, Hàn H, Kang M, Rödl V, Schacht M. Quasi-randomness and algorithmic regularity for graphs with general degree distributions Siam Journal On Computing. 39: 2336-2362. DOI: 10.1137/070709529 |
0.709 |
|
| 2010 |
Kostochka A, Pudlák P, Rödl V. Some constructive bounds on Ramsey numbers Journal of Combinatorial Theory, Series B. 100: 439-445. DOI: 10.1016/J.Jctb.2010.01.003 |
0.329 |
|
| 2010 |
Kohayakawa Y, Nagle B, Rödl V, Schacht M. Weak hypergraph regularity and linear hypergraphs Journal of Combinatorial Theory. Series B. 100: 151-160. DOI: 10.1016/J.Jctb.2009.05.005 |
0.637 |
|
| 2010 |
Dudek A, Rödl V. An almost quadratic bound on vertex Folkman numbers Journal of Combinatorial Theory, Series B. 100: 132-140. DOI: 10.1016/J.Jctb.2009.05.004 |
0.59 |
|
| 2010 |
Năstase E, Rödl V, Siggers M. Note on robust critical graphs with large odd girth Discrete Mathematics. 310: 499-504. DOI: 10.1016/J.Disc.2009.03.030 |
0.786 |
|
| 2010 |
Koubek V, Rödl V. On the number of graphs with a given endomorphism monoid Discrete Mathematics. 310: 376-384. DOI: 10.1016/j.disc.2009.03.013 |
0.458 |
|
| 2010 |
Rödl V, Schacht M. Regularity lemmas for graphs Bolyai Society Mathematical Studies. 20: 287-325. DOI: 10.1007/978-3-642-13580-4_11 |
0.666 |
|
| 2010 |
Friedgut E, Rödl V, Schacht M. Ramsey properties of random discrete structures Random Structures and Algorithms. 37: 407-436. DOI: 10.1002/Rsa.V37:4 |
0.573 |
|
| 2009 |
Dudek A, Franěk F, Rödl V. Cliques in Steiner systems Mathematica Slovaca. 59. DOI: 10.2478/S12175-008-0112-1 |
0.548 |
|
| 2009 |
Koubek V, Rödl V, Shemmer B. Representing subdirect product monoids by graphs International Journal of Algebra and Computation. 19: 705-721. DOI: 10.1142/S0218196709005275 |
0.833 |
|
| 2009 |
DUDEK A, FRANKL P, RÖDL V. A Note on Universal and Canonically Coloured Sequences Combinatorics, Probability and Computing. 18: 683-689. DOI: 10.1017/S0963548309009961 |
0.5 |
|
| 2009 |
Lefmann H, Person Y, Rödl V, Schacht M. On colourings of hypergraphs without monochromatic Fano planes Combinatorics Probability and Computing. 18: 803-818. DOI: 10.1017/S0963548309009948 |
0.587 |
|
| 2009 |
Haxell PE, Łuczak T, Peng Y, Rödl V, Ruciński A, Skokan J. The Ramsey number for 3-uniform tight hypergraph cycles Combinatorics Probability and Computing. 18: 165-203. DOI: 10.1017/S096354830800967X |
0.74 |
|
| 2009 |
Rödl V, Ruciński A, Szemerédi E. Perfect matchings in large uniform hypergraphs with large minimum collective degree Journal of Combinatorial Theory, Series A. 116: 613-636. DOI: 10.1016/J.Jcta.2008.10.002 |
0.425 |
|
| 2009 |
Dellamonica D, Rödl V. Hereditary quasi-random properties of hypergraphs Electronic Notes in Discrete Mathematics. 34: 495-499. DOI: 10.1016/j.endm.2009.07.082 |
0.809 |
|
| 2009 |
Dudek A, Năstase E, Rödl V. On k-chromatically connected graphs Discrete Mathematics. 309: 5547-5550. DOI: 10.1016/J.Disc.2008.03.023 |
0.696 |
|
| 2009 |
Rödl V, Schacht M. Generalizations of the removal lemma Combinatorica. 29: 467-501. DOI: 10.1007/S00493-009-2320-X |
0.697 |
|
| 2009 |
Koubek V, Rödl V, Shemmer B. On graphs with a given endomorphism monoid Journal of Graph Theory. 62: 241-262. DOI: 10.1002/Jgt.V62:3 |
0.82 |
|
| 2009 |
Martin DM, Rödl V. XNote on asymptotically good packings Journal of Combinatorial Designs. 17. DOI: 10.1002/Jcd.20233 |
0.515 |
|
| 2008 |
Dudek A, Rödl V. On the Turán Properties of Infinite Graphs The Electronic Journal of Combinatorics. 15. DOI: 10.37236/771 |
0.641 |
|
| 2008 |
Haxell PE, Nagle B, Rödl V. An Algorithmic Version of the Hypergraph Regularity Method Siam Journal On Computing. 37: 1728-1776. DOI: 10.1137/060652385 |
0.451 |
|
| 2008 |
Rödl V, Siggers M. On Ramsey Minimal Graphs Siam Journal On Discrete Mathematics. 22: 467-488. DOI: 10.1137/050647116 |
0.802 |
|
| 2008 |
Dudek A, Rödl V. On the Folkman Numberf(2, 3, 4) Experimental Mathematics. 17: 63-67. DOI: 10.1080/10586458.2008.10129023 |
0.67 |
|
| 2008 |
Dudek A, Rödl V. Finding Folkman Numbers via MAX CUT Problem Electronic Notes in Discrete Mathematics. 30: 99-104. DOI: 10.1016/J.Endm.2008.01.018 |
0.707 |
|
| 2008 |
Nagle B, Rödl V, Schacht M. Note on the 3-graph counting lemma Discrete Mathematics. 308: 4501-4517. DOI: 10.1016/J.Disc.2007.08.054 |
0.725 |
|
| 2008 |
Rödl V, Szemerédi E, Ruciński A. An approximate Dirac-type theorem for k-uniform hypergraphs Combinatorica. 28: 229-260. DOI: 10.1007/S00493-008-2295-Z |
0.422 |
|
| 2008 |
Nagle B, Olsen S, Rödl V, Schacht M. On the Ramsey number of sparse 3-graphs Graphs and Combinatorics. 24: 205-228. DOI: 10.1007/S00373-008-0784-X |
0.712 |
|
| 2008 |
Rödl V, Zich J. Triangulations and the Hajós conjecture Journal of Graph Theory. 59: 293-325. DOI: 10.1002/Jgt.V59:4 |
0.791 |
|
| 2007 |
Rödl V, Schacht M. Property testing in hypergraphs and the removal lemma Proceedings of the Annual Acm Symposium On Theory of Computing. 488-495. DOI: 10.1145/1250790.1250862 |
0.483 |
|
| 2007 |
Rödl V, Ruciński A, Schacht M. Ramsey properties of random k-partite, k-uniform hypergraphs Siam Journal On Discrete Mathematics. 21: 442-460. DOI: 10.1137/060657492 |
0.619 |
|
| 2007 |
Bollobás B, Kohayakawa Y, Rödl V, Schacht M, Taraz A. Essentially infinite colourings of hypergraphs Proceedings of the London Mathematical Society. 95: 709-734. DOI: 10.1112/Plms/Pdm024 |
0.679 |
|
| 2007 |
Rödl V, Schacht M. Regular partitions of hypergraphs: Counting lemmas Combinatorics Probability and Computing. 16: 887-901. DOI: 10.1017/S0963548307008565 |
0.639 |
|
| 2007 |
Rödl V, Schacht M. Regular partitions of hypergraphs: Regularity lemmas Combinatorics Probability and Computing. 16: 833-885. DOI: 10.1017/S0963548307008553 |
0.647 |
|
| 2007 |
Rödl V, Schacht M, Siggers MH, Tokushige N. Integer and fractional packings of hypergraphs Journal of Combinatorial Theory. Series B. 97: 245-268. DOI: 10.1016/J.Jctb.2006.05.006 |
0.778 |
|
| 2007 |
Frankl P, Peng Y, Rödl V, Talbot J. A note on the jumping constant conjecture of Erdős Journal of Combinatorial Theory, Series B. 97: 204-216. DOI: 10.1016/J.Jctb.2006.05.004 |
0.435 |
|
| 2007 |
Mubayi D, Rödl V. On the chromatic number and independence number of hypergraph products Journal of Combinatorial Theory. Series B. 97: 151-155. DOI: 10.1016/J.Jctb.2006.03.005 |
0.359 |
|
| 2007 |
Kohayakawa Y, Rödl V, Schacht M, Sissokho P, Skokan J. Turán's theorem for pseudo-random graphs Journal of Combinatorial Theory. Series A. 114: 631-657. DOI: 10.1016/J.Jcta.2006.08.004 |
0.836 |
|
| 2006 |
Friedgut E, Rödl V, Ruciński A, Tetali P. A sharp threshold for random graphs with a monochromatic triangle in every edge coloring Memoirs of the American Mathematical Society. 179: 0-0. DOI: 10.1090/Memo/0845 |
0.575 |
|
| 2006 |
RÖDL V, RUCINSKI A, SZEMERÉDI E. A Dirac-Type Theorem for 3-Uniform Hypergraphs Combinatorics, Probability and Computing. 15: 229. DOI: 10.1017/S0963548305007042 |
0.404 |
|
| 2006 |
Polcyn J, Rödl V, Ruciński A, Szemerédi E. Short paths in quasi-random triple systems with sparse underlying graphs Journal of Combinatorial Theory, Series B. 96: 584-607. DOI: 10.1016/J.Jctb.2005.12.002 |
0.536 |
|
| 2006 |
Rödl V, Tengan E. A note on a conjecture by Füredi Journal of Combinatorial Theory. Series A. 113: 1214-1218. DOI: 10.1016/J.Jcta.2005.06.006 |
0.778 |
|
| 2006 |
Haxell PE, Łuczak T, Peng Y, Rödl V, Ruciński A, Simonovits M, Skokan J. The Ramsey number for hypergraph cycles I Journal of Combinatorial Theory. Series A. 113: 67-83. DOI: 10.1016/J.Jcta.2005.02.005 |
0.757 |
|
| 2006 |
Rödl V, Ruciński A, Szemerédi E. Perfect matchings in uniform hypergraphs with large minimum degree European Journal of Combinatorics. 27: 1333-1349. DOI: 10.1016/J.Ejc.2006.05.008 |
0.473 |
|
| 2006 |
Mubayi D, Rödl V. Supersaturation for Ramsey-Turán problems Combinatorica. 26: 315-332. DOI: 10.1007/S00493-006-0018-X |
0.382 |
|
| 2006 |
Rödl V, Schacht M, Tengan E, Tokushige N. Density theorems and extremal hypergraph problems Israel Journal of Mathematics. 152: 371-380. DOI: 10.1007/Bf02771992 |
0.791 |
|
| 2006 |
Nagle B, Rödl V, Schacht M. The counting lemma for regular k-uniform hypergraphs Random Structures and Algorithms. 28: 113-179. DOI: 10.1002/Rsa.V28:2 |
0.716 |
|
| 2006 |
Rödl V, Skokan J. Applications of the regularity lemma for uniform hypergraphs Random Structures and Algorithms. 28: 180-194. DOI: 10.1002/Rsa.V28:2 |
0.717 |
|
| 2005 |
Rödl V, Nagle B, Skokan J, Schacht M, Kohayakawa Y. The hypergraph regularity method and its applications. Proceedings of the National Academy of Sciences of the United States of America. 102: 8109-13. PMID 15919821 DOI: 10.1073/Pnas.0502771102 |
0.832 |
|
| 2005 |
Avart C, Rödl V, Schacht M. Every Monotone 3-Graph Property is Testable Electronic Notes in Discrete Mathematics. 22: 539-542. DOI: 10.1137/060652294 |
0.838 |
|
| 2005 |
Rödl V, Thoma L. On cover graphs and dependent arcs in acyclic orientations Combinatorics Probability and Computing. 14: 585-617. DOI: 10.1017/S0963548305006760 |
0.453 |
|
| 2005 |
FERRARA M, KOHAYAKAWA Y, RÖDL V. Distance Graphs on the Integers Combinatorics, Probability and Computing. 14: 107-131. DOI: 10.1017/S0963548304006637 |
0.407 |
|
| 2005 |
Peng Y, Rödl V, Skokan J. Counting small cliques in 3-uniform hypergraphs Combinatorics Probability and Computing. 14: 371-413. DOI: 10.1017/S0963548304006546 |
0.767 |
|
| 2005 |
Rödl V, Skokan J. Counting subgraphs in quasi-random 4-uniform hypergraphs Random Structures and Algorithms. 26: 160-203. DOI: 10.1002/Rsa.V26:1/2 |
0.73 |
|
| 2004 |
Mubayi D, Rödl V. Uniform Edge Distribution in Hypergraphs is Hereditary The Electronic Journal of Combinatorics. 11. DOI: 10.37236/1808 |
0.329 |
|
| 2004 |
Kohayakawa Y, Rödl V, Schacht M. The Turán theorem for random graphs Combinatorics Probability and Computing. 13: 61-91. DOI: 10.1017/S0963548303005856 |
0.687 |
|
| 2004 |
Kostochka* AV, Rödl† V. On Graphs With Small Ramsey Numbers, II Combinatorica. 24: 389-401. DOI: 10.1007/s00493-004-0024-9 |
0.365 |
|
| 2004 |
Kohayakawa Y, Rödl V, Sissokho P. Embedding graphs with bounded degree in sparse pseudorandom graphs Israel Journal of Mathematics. 139: 93-137. DOI: 10.1007/Bf02787543 |
0.779 |
|
| 2004 |
Rödl V, Skokan J. Regularity Lemma for k-uniform hypergraphs Random Structures and Algorithms. 25: 1-42. DOI: 10.1002/Rsa.20017 |
0.755 |
|
| 2003 |
Kohayakawa Y, Rödl V, Thoma L. An optimal algorithm for checking regularity Siam Journal On Computing. 32: 1210-1235. DOI: 10.1137/S0097539702408223 |
0.354 |
|
| 2003 |
Friedgut E, Kohayakawa Y, Rodl V, Rucinski A, Tetali P. Ramsey Games Against a One-Armed Bandit Combinatorics, Probability and Computing. 12: 515-545. DOI: 10.1017/S0963548303005881 |
0.417 |
|
| 2003 |
Gunderson DS, Leader I, Prömel HJ, Rödl V. Independent Deuber sets in graphs on the natural numbers Journal of Combinatorial Theory, Series A. 103: 305-322. DOI: 10.1016/S0097-3165(03)00100-6 |
0.431 |
|
| 2003 |
Nagle B, Rödl V. Regularity properties for triple systems Random Structures & Algorithms. 23: 264-332. DOI: 10.1002/Rsa.10094 |
0.567 |
|
| 2003 |
Kohayakawa Y, Rödl V. Regular pairs in sparse random graphs I Random Structures & Algorithms. 22: 359-434. DOI: 10.1002/rsa.10081 |
0.444 |
|
| 2002 |
Graham R, Łuczak T, Rödl V, Ruciński A. Ramsey Properties of Families of Graphs Journal of Combinatorial Theory, Series B. 86: 413-419. DOI: 10.1006/Jctb.2002.2136 |
0.397 |
|
| 2002 |
Mubayi D, Rödl V. On the turán number of triple systems Journal of Combinatorial Theory. Series A. 100: 136-152. DOI: 10.1006/Jcta.2002.3284 |
0.563 |
|
| 2002 |
Kohayakawa Y, Rödl V, Skokan J. Hypergraphs, Quasi-randomness, and conditions for regularity Journal of Combinatorial Theory. Series A. 97: 307-352. DOI: 10.1006/Jcta.2001.3217 |
0.704 |
|
| 2002 |
Dementieva Y, Haxell PE, Nagle B, Rödl V. On characterizing hypergraph regularity Random Structures & Algorithms. 21: 293-335. DOI: 10.1002/Rsa.10058 |
0.441 |
|
| 2002 |
Frankl P, Rödl V. Extremal problems on set systems Random Structures & Algorithms. 20: 131-164. DOI: 10.1002/Rsa.10017.Abs |
0.388 |
|
| 2001 |
Peng Y, Rödl V, Ruciński A. Holes in Graphs The Electronic Journal of Combinatorics. 9. DOI: 10.37236/1618 |
0.663 |
|
| 2001 |
Rödl V, Rucinski A, Wagner M. Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma Siam Journal On Computing. 31: 428-446. DOI: 10.1137/S0097539700371053 |
0.526 |
|
| 2001 |
Haxell PE, Rödl V. Integer and Fractional Packings in Dense Graphs Combinatorica. 21: 13-38. DOI: 10.1007/S004930170003 |
0.523 |
|
| 2001 |
Graham RL, Rödl V, Ruciński A. On bipartite graphs with linear ramsey numbers Combinatorica. 21: 199-209. DOI: 10.1007/S004930100018 |
0.56 |
|
| 2001 |
Gunderson DS, Leader I, Prömel HJ, Rödl V. Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers Journal of Combinatorial Theory, Series A. 93: 1-17. DOI: 10.1006/jcta.1999.3007 |
0.42 |
|
| 2001 |
Kostochka AV, Rödl V. On graphs with small Ramsey numbers* Journal of Graph Theory. 37: 198-204. DOI: 10.1002/jgt.1014 |
0.437 |
|
| 2000 |
Czygrinow A, Rödl V. An Algorithmic Regularity Lemma for Hypergraphs Siam Journal On Computing. 30: 1041-1066. DOI: 10.1137/S0097539799351729 |
0.303 |
|
| 2000 |
Rödl V, Szemerédi E. On Size Ramsey Numbers of Graphs with Bounded Degree Combinatorica. 20: 257-262. DOI: 10.1007/S004930070024 |
0.357 |
|
| 2000 |
Kohayakawa Y, Rödl V, Skokan J. Equivalent conditions for regularity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1776: 48-57. DOI: 10.1007/10719839_5 |
0.715 |
|
| 1999 |
RÖDL V, RUCIŃSKI A, TARAZ A. Hypergraph Packing and Graph Embedding Combinatorics, Probability and Computing. 8: 363-376. DOI: 10.1017/S0963548399003879 |
0.339 |
|
| 1999 |
Rödl V, Ruciński A. Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma Combinatorica. 19: 437-452. DOI: 10.1007/S004930050063 |
0.501 |
|
| 1999 |
Prömel HJ, Rödl V. Non-Ramsey Graphs Are clogn-Universal Journal of Combinatorial Theory, Series A. 88: 379-384. DOI: 10.1006/jcta.1999.2972 |
0.424 |
|
| 1998 |
Alon N, Rödl V, Ruciński A. Perfect Matchings in $\epsilon$-regular Graphs The Electronic Journal of Combinatorics. 5. DOI: 10.37236/1351 |
0.465 |
|
| 1998 |
Bertram-Kretzberg C, Lefmann H, Rödl V, Wysocka B. Proper Bounded Edge-Colorings Discrete Mathematics & Theoretical Computer Science. 121-130. DOI: 10.17877/De290R-5019 |
0.401 |
|
| 1998 |
ŁUCZAK T, RÖDL V, SZEMERÉDI E. Partitioning Two-Coloured Complete Graphs into
Two Monochromatic Cycles Combinatorics, Probability and Computing. 7: 423-436. DOI: 10.1017/S0963548398003599 |
0.424 |
|
| 1998 |
GUNDERSON DS, RÖDL V. Extremal Problems for Affine Cubes of Integers Combinatorics, Probability and Computing. 7: 65-79. DOI: 10.1017/S0963548397003283 |
0.318 |
|
| 1998 |
Luczak T, Rödl V, Schoen T. Independent finite sums in graphs defined on the natural numbers Discrete Mathematics. 181: 289-294. DOI: 10.1016/S0012-365X(97)00064-2 |
0.424 |
|
| 1998 |
Kohayakawa, Y, Prömel HJ, Rödl V. Induced Ramsey Numbers Combinatorica. 18: 373-404. DOI: 10.1007/Pl00009828 |
0.539 |
|
| 1998 |
Kostochka AV, Rödl V. On Large Systems of Sets with No Large Weak Δ-subsystems Combinatorica. 18: 235-240. DOI: 10.1007/Pl00009819 |
0.319 |
|
| 1998 |
Rödl V, Ruciński A. Ramsey Properties of Random Hypergraphs Journal of Combinatorial Theory, Series A. 81: 1-33. DOI: 10.1006/Jcta.1997.2785 |
0.42 |
|
| 1997 |
Pudlák P, Rödl V, Sgall J. Boolean Circuits, Tensor Ranks, and Communication Complexity Siam Journal On Computing. 26: 605-633. DOI: 10.1137/S0097539794264809 |
0.362 |
|
| 1997 |
RÖDL V, RUCIŃSKI A. Bipartite Coverings of Graphs Combinatorics, Probability and Computing. 6: 349-352. DOI: 10.1017/S0963548397003064 |
0.519 |
|
| 1997 |
Kohayakawa Y, Łuczak T, Rödl V. OnK 4-free subgraphs of random graphs Combinatorica. 17: 173-213. DOI: 10.1007/BF01200906 |
0.435 |
|
| 1997 |
Rödl V, Wysocka B. Note on regular subgraphs Journal of Graph Theory. 24: 139-154. DOI: 10.1002/(Sici)1097-0118(199702)24:2<139::Aid-Jgt2>3.3.Co;2-7 |
0.494 |
|
| 1996 |
Graham R, Rödl V, Ruciński A. On Schur Properties of Random Subsets of Integers Journal of Number Theory. 61: 388-408. DOI: 10.1006/Jnth.1996.0155 |
0.38 |
|
| 1996 |
Łuczak T, Rödl V. On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree Journal of Combinatorial Theory, Series B. 66: 324-333. DOI: 10.1006/jctb.1996.0025 |
0.433 |
|
| 1996 |
Lefmann H, Rödl V, Wysocka B. Multicolored Subsets in Colored Hypergraphs Journal of Combinatorial Theory, Series A. 74: 209-248. DOI: 10.1006/Jcta.1996.0049 |
0.45 |
|
| 1996 |
Kierstead HA, Rodl V. Applications of hypergraph coloring to coloring graphs not inducing certain trees Discrete Mathematics. 150: 187-193. |
0.396 |
|
| 1995 |
Duke RA, Lefmann H, Rödl V. A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph Siam Journal On Computing. 24: 598-620. DOI: 10.1137/S0097539793247634 |
0.523 |
|
| 1995 |
Duffus D, Lefmann H, Rödl V. Shift graphs and lower bounds on Ramsey numbers rk(l; r) Discrete Mathematics. 137: 177-187. DOI: 10.1016/0012-365X(93)E0139-U |
0.348 |
|
| 1995 |
Rödl V, Thoma L. The complexity of cover graph recognition for some varieties of finite lattices Order. 12: 351-374. DOI: 10.1007/BF01110379 |
0.501 |
|
| 1995 |
Pyber L, Rodl V, Szemeredi E. Dense Graphs without 3-Regular Subgraphs Journal of Combinatorial Theory, Series B. 63: 41-54. DOI: 10.1006/Jctb.1995.1004 |
0.504 |
|
| 1995 |
Erdös P, Rödl V. Coverings of r-graphs by complete r-partite subgraphs Random Structures & Algorithms. 6: 319-322. DOI: 10.1002/Rsa.3240060218 |
0.407 |
|
| 1995 |
Duke RA, Lefmann H, Rödl V. On uncrowded hypergraphs Random Structures & Algorithms. 6: 209-212. DOI: 10.1002/Rsa.3240060208 |
0.366 |
|
| 1995 |
Rödl V, Thomas R. On the genus of a random graph Random Structures & Algorithms. 6: 1-12. DOI: 10.1002/rsa.3240060102 |
0.442 |
|
| 1994 |
Haddad L, Rödl V. Unbalanced steiner triple systems Journal of Combinatorial Theory, Series A. 66: 1-16. DOI: 10.1016/0097-3165(94)90046-9 |
0.304 |
|
| 1994 |
Rödl V, Ruciński A. Random graphs with monochromatic triangles in every edge coloring Random Structures & Algorithms. 5: 253-270. DOI: 10.1002/Rsa.3240050202 |
0.525 |
|
| 1993 |
Franek F, Rödl V. 2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs Discrete Mathematics. 114: 199-203. DOI: 10.1016/0012-365X(93)90366-2 |
0.438 |
|
| 1993 |
Gould RJ, Rödl V. On isomorphic subgraphs Discrete Mathematics. 118: 259-262. DOI: 10.1016/0012-365X(93)90069-6 |
0.401 |
|
| 1993 |
Nešetřil J, Rödl V. Complexity of diagrams Order. 10: 393-393. DOI: 10.1007/Bf00340774 |
0.423 |
|
| 1993 |
Gunderson DS, Rodl V, Sauer NW. Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs Journal of Combinatorial Theory, Series B. 59: 199-209. DOI: 10.1006/jctb.1993.1066 |
0.474 |
|
| 1993 |
Rodl V, Voigt B. Monochromatic Trees with Respect to Edge Partitions Journal of Combinatorial Theory, Series B. 58: 291-298. DOI: 10.1006/jctb.1993.1045 |
0.343 |
|
| 1993 |
Lefmann H, Rodl V. On Canonical Ramsey Numbers for Complete Graphs versus Paths Journal of Combinatorial Theory, Series B. 58: 1-13. DOI: 10.1006/jctb.1993.1025 |
0.444 |
|
| 1992 |
Rödl V, Sauer N. The Ramsey Property for Families of Graphs Which Exclude a Given Graph Canadian Journal of Mathematics. 44: 1050-1060. DOI: 10.4153/cjm-1992-064-7 |
0.417 |
|
| 1992 |
Reiterman J, Rödl V, S̆in̆ajová E. On embedding of graphs into euclidean spaces of small dimension Journal of Combinatorial Theory, Series B. 56: 1-8. DOI: 10.1016/0095-8956(92)90002-F |
0.364 |
|
| 1992 |
Duke RA, Erdős P, Rödl V. Cycle-connected graphs Discrete Mathematics. 108: 261-278. DOI: 10.1016/0012-365X(92)90680-E |
0.414 |
|
| 1992 |
Nešetřil J, Rödl V. On Ramsey graphs without bipartite subgraphs Discrete Mathematics. 101: 223-229. DOI: 10.1016/0012-365X(92)90605-F |
0.442 |
|
| 1992 |
Franek F, Rödl V. Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs Graphs and Combinatorics. 8: 299-308. DOI: 10.1007/BF02351585 |
0.396 |
|
| 1992 |
Pudlák P, Rödl V. A combinatorial approach to complexity Combinatorica. 12: 221-226. DOI: 10.1007/Bf01204724 |
0.476 |
|
| 1992 |
Duffus D, Rodl V, Sands B, Woodrow R. Enumeration of order preserving maps Order. 9: 15-29. DOI: 10.1007/Bf00419036 |
0.318 |
|
| 1992 |
Eaton N, Rödl V. A Canonical Ramsey Theorem Random Structures and Algorithms. 3: 427-444. DOI: 10.1002/Rsa.3240030406 |
0.378 |
|
| 1992 |
Rödl V, Tuza Z. Rainbow subgraphs in properly edge-colored graphs Random Structures & Algorithms. 3: 175-182. DOI: 10.1002/Rsa.3240030207 |
0.535 |
|
| 1990 |
Maehara H, Rödl V. On the dimension to represent a graph by a unit distance graph Graphs and Combinatorics. 6: 365-367. DOI: 10.1007/Bf01787703 |
0.515 |
|
| 1989 |
Rödl V, Winkler P. A Ramsey-Type Theorem for Orderings of a Graph Siam Journal On Discrete Mathematics. 2: 402-406. DOI: 10.1137/0402035 |
0.522 |
|
| 1989 |
Nešetřil J, Rödl V. Chromatically optimal rigid graphs Journal of Combinatorial Theory, Series B. 46: 133-141. DOI: 10.1016/0095-8956(89)90039-7 |
0.356 |
|
| 1989 |
Reiterman J, Rödl V, Šinˇajová E. Geometrical embeddings of graphs Discrete Mathematics. 74: 291-319. DOI: 10.1016/0012-365X(89)90142-8 |
0.441 |
|
| 1988 |
Frankl P, Rödl V, Wilson R. The number of submatrices of a given type in a Hadamard matrix and related results Journal of Combinatorial Theory, Series B. 44: 317-328. DOI: 10.1016/0095-8956(88)90040-8 |
0.448 |
|
| 1988 |
Frankl P, Rödl V. Some Ramsey-Turán type results for hypergraphs Combinatorica. 8: 323-332. DOI: 10.1007/Bf02189089 |
0.494 |
|
| 1987 |
Gyárfás A, Lehel J, Nešetřil J, Rödl V, Schelp R, Tuza Z. Local k-colorings of graphs and hypergraphs Journal of Combinatorial Theory, Series B. 43: 127-139. DOI: 10.1016/0095-8956(87)90017-7 |
0.396 |
|
| 1986 |
Rödl V. On universality of graphs with uniformly distributed edges Discrete Mathematics. 59: 125-134. DOI: 10.1016/0012-365X(86)90076-2 |
0.387 |
|
| 1986 |
Erdös P, Füredi Z, Hajnal A, Komjáth P, Rödl V, Seress A. Coloring graphs with locally few colors Discrete Mathematics. 59: 21-34. DOI: 10.1016/0012-365X(86)90065-8 |
0.401 |
|
| 1986 |
Frankl P, Rödl V. Large triangle-free subgraphs in graphs withoutK 4 Graphs and Combinatorics. 2: 135-144. DOI: 10.1007/BF01788087 |
0.431 |
|
| 1986 |
Erdös P, Frankl P, Rödl V. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent Graphs and Combinatorics. 2: 113-121. DOI: 10.1007/BF01788085 |
0.431 |
|
| 1986 |
Komjáth P, Rödl V. Coloring of universal graphs Graphs and Combinatorics. 2: 55-60. DOI: 10.1007/BF01788077 |
0.405 |
|
| 1985 |
Nešetřil J, Rödl V. Three Remarks on Dimensions of Graphs North-Holland Mathematics Studies. 118: 199-207. DOI: 10.1016/S0304-0208(08)73621-1 |
0.514 |
|
| 1985 |
Frankl P, Rödl V. Near Perfect Coverings in Graphs and Hypergraphs European Journal of Combinatorics. 6: 317-326. DOI: 10.1016/S0195-6698(85)80045-7 |
0.552 |
|
| 1985 |
Rödl V, Tuza Z. On color critical graphs Journal of Combinatorial Theory, Series B. 38: 204-213. DOI: 10.1016/0095-8956(85)90066-8 |
0.564 |
|
| 1985 |
Burr SA, Nešetřil J, Rödl V. On the use of senders in generalized ramsey theory for graphs Discrete Mathematics. 54: 1-13. DOI: 10.1016/0012-365X(85)90057-3 |
0.508 |
|
| 1985 |
Rödl V. Note on a Ramsey-Turán type problem Graphs and Combinatorics. 1: 291-293. DOI: 10.1007/Bf02582954 |
0.495 |
|
| 1985 |
Rödl V, Duke RA. On graphs with small subgraphs of large chromatic number Graphs and Combinatorics. 1: 91-96. DOI: 10.1007/BF02582932 |
0.43 |
|
| 1984 |
Koubek V, Rödl V. On the minimum order of graphs with given semigroup Journal of Combinatorial Theory, Series B. 36: 135-155. DOI: 10.1016/0095-8956(84)90021-2 |
0.43 |
|
| 1984 |
Phelps KT, Rödl V. On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems Combinatorica. 4: 79-88. DOI: 10.1007/Bf02579160 |
0.32 |
|
| 1984 |
Nešetřil J, Rödl V. Sparse ramsey graphs Combinatorica. 4: 71-78. DOI: 10.1007/BF02579159 |
0.442 |
|
| 1983 |
Chvatál C, Rödl V, Szemerédi E, Trotter WT. The Ramsey number of a graph with bounded maximum degree Journal of Combinatorial Theory, Series B. 34: 239-243. DOI: 10.1016/0095-8956(83)90037-0 |
0.561 |
|
| 1982 |
Pudlák P, Rödl V. Partition theorems for systems of finite subsets of integers Discrete Mathematics. 39: 67-73. DOI: 10.1016/0012-365X(82)90041-3 |
0.313 |
|
| 1982 |
Rödl V. Nearly bipartite graphs with large chromatic number Combinatorica. 2: 377-383. DOI: 10.1007/BF02579434 |
0.441 |
|
| 1982 |
Müller V, Rödl V. Monotone paths in ordered graphs Combinatorica. 2: 193-201. DOI: 10.1007/BF02579318 |
0.402 |
|
| 1981 |
Poljak S, Rödl V. On the arc-chromatic number of a digraph Journal of Combinatorial Theory, Series B. 31: 190-198. DOI: 10.1016/S0095-8956(81)80024-X |
0.439 |
|
| 1981 |
Poljak S, Rödl V, Turzík D. Complexity of representation of graphs by set systems Discrete Applied Mathematics. 3: 301-312. DOI: 10.1016/0166-218X(81)90007-X |
0.338 |
|
| 1978 |
Nešetřil J, R{ödl V. On a probabilistic graph-theoretical method Proceedings of the American Mathematical Society. 72: 417-417. DOI: 10.1090/S0002-9939-1978-0507350-7 |
0.39 |
|
| 1978 |
Nešetřil J, Rodl V. A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph Discrete Mathematics. 23: 49-55. DOI: 10.1016/0012-365X(78)90186-3 |
0.456 |
|
| 1978 |
Nešetřil J, Rödl V. The structure of critical Ramsey graphs Acta Mathematica Academiae Scientiarum Hungaricae. 32: 295-300. DOI: 10.1007/BF01902367 |
0.382 |
|
| 1977 |
Rodl V. On the chromatic number of subgraphs of a given graph Proceedings of the American Mathematical Society. 64: 370-371. DOI: 10.1090/S0002-9939-1977-0469806-4 |
0.36 |
|
| 1976 |
Nešetřil J, Rödl V. The Ramsey property for graphs with forbidden complete subgraphs Journal of Combinatorial Theory, Series B. 20: 243-249. DOI: 10.1016/0095-8956(76)90015-0 |
0.44 |
|
| Show low-probability matches. |