| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski |
Universality of Random Graphs. |
SIAM J. Discrete Math. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski |
An Improved Upper Bound on the Density of Universal Random Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingos Dellamonica Jr., Vojtech Rödl |
A note on Thomassenʼs conjecture. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dwight Duffus, Peter Frankl, Vojtech Rödl |
Maximal independent sets in bipartite graphs obtained from Boolean lattices. |
Eur. J. Comb. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Dudek, Vojtech Rödl |
On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingos Dellamonica Jr., Vojtech Rödl |
Hereditary quasirandom properties of hypergraphs. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl |
The maximum size of a Sidon set contained in a sparse random set of integers. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl |
Some constructive bounds on Ramsey numbers. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht |
Weak hypergraph regularity and linear hypergraphs. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Dudek, Vojtech Rödl |
An almost quadratic bound on vertex Folkman numbers. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Václav Koubek, Vojtech Rödl |
On the number of graphs with a given endomorphism monoid. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers |
Note on robust critical graphs with large odd girth. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehud Friedgut, Vojtech Rödl, Mathias Schacht |
Ramsey properties of random discrete structures. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Vojtech Rödl |
Constructions of sparse uniform hypergraphs with high chromatic number. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi |
Perfect matchings in large uniform hypergraphs with large minimum collective degree. |
J. Comb. Theory, Ser. A |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingos Dellamonica Jr., Vojtech Rödl |
Hereditary quasi-random properties of hypergraphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Václav Koubek, Vojtech Rödl, Benjamin Shemmer |
Representing Subdirect Product Monoids by Graphs. |
IJAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Dudek, Esmeralda Nastase, Vojtech Rödl |
On k-chromatically connected graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht |
On Colourings of Hypergraphs Without Monochromatic Fano Planes. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Dudek, Peter Frankl, Vojtech Rödl |
A Note on Universal and Canonically Coloured Sequences. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Mathias Schacht |
Generalizations of the removal lemma. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Václav Koubek, Vojtech Rödl, Benjamin Shemmer |
On graphs with a given endomorphism monoid. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht |
Hypergraph regularity and quasi-randomness. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl |
Colorful Flowers. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Dudek, Vojtech Rödl |
Finding Folkman Numbers via MAX CUT Problem. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Nagle, Vojtech Rödl, Mathias Schacht |
Note on the 3-graph counting lemma. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Dudek, Vojtech Rödl |
On the Turán Properties of Infinite Graphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht |
On the Ramsey Number of Sparse 3-Graphs. |
Graphs and Combinatorics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski |
An approximate Dirac-type theorem for k -uniform hypergraphs. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C65, 05C45, 05D05 |
| 1 | Jan Zich, Yoshiharu Kohayakawa, Vojtech Rödl, V. Sunderam |
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness. |
Internet Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Mark H. Siggers |
On Ramsey Minimal Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Jan Zich |
Triangulations and the Hajós conjecture. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Penny E. Haxell, Brendan Nagle, Vojtech Rödl |
An Algorithmic Version of the Hypergraph Regularity Method. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski |
Universality of random graphs. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Dudek, Vojtech Rödl |
New Upper Bound on Vertex Folkman Numbers. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
vertex Folkman numbers, Ramsey theory |
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige |
Integer and fractional packings of hypergraphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhruv Mubayi, Vojtech Rödl |
On the chromatic number and independence number of hypergraph products. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger |
Small subsets inherit sparse epsilon-regularity. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa Sissokho, Jozef Skokan |
Turán's theorem for pseudo-random graphs. |
J. Comb. Theory, Ser. A |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Mathias Schacht |
Regular Partitions of Hypergraphs: Counting Lemmas. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Mathias Schacht |
Regular Partitions of Hypergraphs: Regularity Lemmas. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Andrzej Rucinski, Mathias Schacht |
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Avart, Vojtech Rödl, Mathias Schacht |
Every Monotone 3-Graph Property is Testable. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
quasi-random graphs, Laplacian eigenvalues, Grothendieck’s inequality, regularity lemma, sparse graphs |
| 1 | Vojtech Rödl, Mathias Schacht |
Property testing in hypergraphs and the removal lemma. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
hereditary properties, removal lemma, hypergraphs, property testing, regularity lemma |
| 1 | Alexandr V. Kostochka, Vojtech Rödl |
On Ramsey numbers of uniform hypergraphs with given maximum degree. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, E. Tengan |
A note on a conjecture by Füredi. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi |
Perfect matchings in uniform hypergraphs with large minimum degree. |
Eur. J. Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Nagle, Vojtech Rödl, Mathias Schacht |
The counting lemma for regular k-uniform hypergraphs. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Jozef Skokan |
Applications of the regularity lemma for uniform hypergraphs. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi |
A Dirac-Type Theorem for 3-Uniform Hypergraphs. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhruv Mubayi, Vojtech Rödl |
Supersaturation For Ramsey-Turán Problems. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35, 05D05, 05C65 |
| 1 | Vojtech Rödl, Mark H. Siggers |
Color critical hypergraphs with many edges. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Avart, Vojtech Rödl, Mathias Schacht |
Every Monotone 3-Graph Property is Testable. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Jozef Skokan |
Counting subgraphs in quasi-random 4-uniform hypergraphs. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl |
Distance Graphs on the Integers. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Lubos Thoma |
On Cover Graphs and Dependent Arcs in Acyclic Orientations. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuejian Peng, Vojtech Rödl, Jozef Skokan |
Counting Small Cliques in 3-uniform Hypergraphs. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Vojtech Rödl |
Sharp Bounds For Some Multicolor Ramsey Numbers. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C55 |
| 1 | Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl |
The Generalization of Dirac's Theorem for Hypergraphs. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Penny E. Haxell, Brendan Nagle, Vojtech Rödl |
An Algorithmic Version of the Hypergraph Regularity Method. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhruv Mubayi, Vojtech Rödl |
Uniform Edge Distribution in Hypergraphs is Hereditary. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Vojtech Rödl, Jozef Skokan |
Regularity Lemma for k-uniform hypergraphs. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht |
The Turán Theorem for Random Graphs. |
Combinatorics, Probability & Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Vojtech Rödl |
On Graphs With Small Ramsey Numbers, II. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C55, 05C35 |
| 1 | Vojtech Rödl |
On homogeneous sets of positive integers. |
J. Comb. Theory, Ser. A |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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, Ser. A |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Penny E. Haxell, Brendan Nagle, Vojtech Rödl |
Integer and fractional packings in dense 3-uniform hypergraphs. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard A. Duke, Paul Erdös, Vojtech Rödl |
On large intersecting subfamilies of uniform setfamilies. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Vojtech Rödl |
Regular pairs in sparse random graphs I. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Nagle, Vojtech Rödl |
Regularity properties for triple systems. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali |
Ramsey Games Against a One-Armed Bandit. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl |
Hereditary Properties Of Triple Systems. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma |
An Optimal Algorithm for Checking Regularity. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhruv Mubayi, Vojtech Rödl |
On the Turán Number of Triple Systems. |
J. Comb. Theory, Ser. A |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan |
Hypergraphs, Quasi-randomness, and Conditions for Regularity. |
J. Comb. Theory, Ser. A |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski |
Ramsey Properties of Families of Graphs. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuejian Peng, Vojtech Rödl, Andrzej Rucinski |
Holes in Graphs. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Peter Frankl, Vojtech Rödl |
Extremal problems on set systems. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl |
On characterizing hypergraph regularity. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma |
An optimal algorithm for checking regularity (extended abstract). |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl |
Efficient Testing of Hypergraphs. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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, Ser. A |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Nagle, Vojtech Rödl |
The asymptotic number of triple systems not containing a fixed one. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali |
On the chromatic number of set systems. |
Random Struct. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Penny E. Haxell, Vojtech Rödl |
Integer and Fractional Packings in Dense Graphs. |
Combinatorica |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C70, 05C85 |
| 1 | Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski |
On Bipartite Graphs with Linear Ramsey Numbers. |
Combinatorica |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C55, 05C80, 05D40 |
| 1 | Vojtech Rödl, Andrzej Rucinski, Michelle Wagner |
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Endre Szemerédi |
On Size Ramsey Numbers of Graphs with Bounded Degree. |
Combinatorica |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")