+
PDF
Chat
|
A lower bound on the Ramsey number $R_k(k+1,k+1)$
|
2024
|
Pavel Pudlák
Vojtěch Rödl
|
+
PDF
Chat
|
Coloring triangles in graphs
|
2024
|
Ayush Basu
Vojtěch Rödl
Marcelo Sales
|
+
|
Colouring versus density in integers and Hales–Jewett cubes
|
2024
|
Christian Reiher
Vojtěch Rödl
Marcelo Sales
|
+
PDF
Chat
|
Ramsey-type problems for generalised Sidon sets
|
2024
|
Christian Reiher
Vojtěch Rödl
Mathias Schacht
|
+
PDF
Chat
|
Subgraphs with a positive minimum semidegree in digraphs with large
outdegree
|
2024
|
Andrzej Grzesik
Vojtěch Rödl
Jan Volec
|
+
|
On Pisier Type Theorems
|
2024
|
Jaroslav Nešetřil
Vojtěch Rödl
Marcelo Sales
|
+
PDF
|
Some results and problems on clique coverings of hypergraphs
|
2024
|
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
|
Equivalent regular partitions of three‐uniform hypergraphs
|
2024
|
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
|
+
PDF
Chat
|
The number of cliques in hypergraphs with forbidden subgraphs
|
2024
|
Ayush Basu
Vojtěch Rödl
Yi Zhao
|
+
PDF
|
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links
|
2024
|
Sören Berger
Simón Piga
Christian Reiher
Vojtěch Rödl
Mathias Schacht
|
+
PDF
Chat
|
The $k$-representation number of the random graph
|
2024
|
Ayush Basu
Vojtěch Rödl
Marcelo Magalhães Sales
|
+
PDF
Chat
|
Note on set representation of bounded degree hypergaphs
|
2024
|
Ayush Basu
Griffin Johnston
Vojtěch Rödl
Marcelo Magalhães Sales
|
+
PDF
Chat
|
Nowhere dense Ramsey sets
|
2024
|
Vojtěch Rödl
Marcelo Sales
|
+
PDF
Chat
|
Colorings of $k$-sets with low discrepancy on small sets
|
2024
|
Pavel Pudlák
Vojtěch Rödl
|
+
PDF
|
Independence number of hypergraphs under degree conditions
|
2023
|
Vojtěch Rödl
Marcelo Tadeu Sales
Yi Zhao
|
+
|
The girth Ramsey theorem
|
2023
|
Christian Reiher
Vojtěch Rödl
|
+
|
Colouring versus density in integers and Hales-Jewett cubes
|
2023
|
Christian Reiher
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
PDF
|
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree
|
2022
|
Andrii Arman
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
PDF
|
On quantitative aspects of a canonisation theorem for edge‐orderings
|
2022
|
Christian Reiher
Vojtěch Rödl
Marcelo Tadeu Sales
Kevin Sames
Mathias Schacht
|
+
PDF
Chat
|
Extractors for Small Zero-Fixing Sources
|
2022
|
Pavel Pudlák
Vojtěch Rödl
|
+
PDF
|
Independent Sets in Subgraphs of a Shift Graph
|
2022
|
Andrii Arman
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
|
Independence number of hypergraphs under degree conditions
|
2022
|
Vojtěch Rödl
Marcelo Magalhães Sales
Yi Zhao
|
+
|
Some results and problems on clique coverings of hypergraphs
|
2022
|
Vojtěch Rödl
Marcelo Magalhães Sales
|
+
|
Turán density of cliques of order five in $3$-uniform hypergraphs with quasirandom links
|
2022
|
Sören Berger
Simón Piga
Christian Reiher
Vojtěch Rödl
Mathias Schacht
|
+
|
On the Ramsey number of daisies I
|
2022
|
Pavel Pudlák
Vojtěch Rödl
Marcelo Magalhães Sales
|
+
PDF
|
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm
|
2021
|
Michal Koucký
Vojtěch Rödl
Navid Talebanfard
|
+
PDF
Chat
|
A blurred view of Van der Waerden type theorems
|
2021
|
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
PDF
|
On strong Sidon sets of integers
|
2021
|
Yoshiharu Kohayakawa
Sang June Lee
Carlos Gustavo Moreira
Vojtěch Rödl
|
+
PDF
|
Increasing paths in countable graphs
|
2021
|
Andrii Arman
Bradley Elliott
Vojtěch Rödl
|
+
|
Independent sets in subgraphs of a shift graph
|
2021
|
Andrii Arman
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
|
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm
|
2021
|
Michal Koucký
Vojtěch Rödl
Navid Talebanfard
|
+
PDF
|
On Hamiltonian cycles in hypergraphs with dense link graphs
|
2021
|
Joanna Polcyn
Christian Reiher
Vojtěch Rödl
Bjarne Schülke
|
+
PDF
Chat
|
Ramsey-type numbers involving graphs and hypergraphs with large girth
|
2021
|
Hiệp Hàn
Troy Retter
Vojtěch Rödl
Mathias Schacht
|
+
|
Colourful matchings
|
2021
|
Andrii Arman
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
|
A blurred view of Van der Waerden type theorems
|
2021
|
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
|
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links
|
2021
|
Sören Berger
Simón Piga
Christian Reiher
Vojtěch Rödl
Mathias Schacht
|
+
|
A note on the induced Ramsey theorem for spaces
|
2021
|
Bryce Frederickson
Vojtěch Rödl
Marcelo Magalhães Sales
|
+
|
Independent sets in subgraphs of a shift graph
|
2021
|
Andrii Arman
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
|
Every Steiner triple system contains an almost spanning d-ary hypertree
|
2021
|
Andrii Arman
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
|
A blurred view of Van der Waerden type theorems
|
2021
|
Vojtěch Rödl
Marcelo Magalhães Sales
|
+
|
Colourful matchings
|
2021
|
Andrii Arman
Vojtěch Rödl
Marcelo Tadeu Sales
|
+
PDF
|
On local Turán problems
|
2020
|
Péter Frankl
Hao Huang
Vojtěch Rödl
|
+
|
On Hamiltonian cycles in hypergraphs with dense link graphs
|
2020
|
Joanna Polcyn
Christian Reiher
Vojtěch Rödl
Bjarne Schülke
|
+
|
On local Tur\'an problems
|
2020
|
Péter Frankl
Hao Huang
Vojtěch Rödl
|
+
|
On quantitative aspects of a canonisation theorem for edge-orderings
|
2020
|
Christian Reiher
Vojtěch Rödl
Marcelo Magalhães Sales
Kevin Sames
Mathias Schacht
|
+
|
On local Turán problems
|
2020
|
Péter Frankl
Hao Huang
Vojtěch Rödl
|
+
|
Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs
|
2019
|
Christian Reiher
Vojtěch Rödl
Andrzej Ruciński
Mathias Schacht
Bjarne Schülke
|
+
PDF
|
A note on weak delta systems
|
2019
|
Andrii Arman
Bill Kay
Vojtěch Rödl
|
+
|
Increasing paths in countable graphs
|
2019
|
Andrii Arman
Bradley Elliott
Vojtěch Rödl
|
+
|
Extractors for small zero-fixing sources
|
2019
|
Pavel Pudlák
Vojtěch Rödl
|
+
PDF
Chat
|
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
|
2019
|
Christian Reiher
Vojtěch Rödl
Andrzej Ruciński
Mathias Schacht
Endre Szemerédi
|
+
|
Extractors for small zero-fixing sources.
|
2019
|
Pavel Pudlák
Vojtěch Rödl
|
+
|
Packing Paths in Steiner Triple Systems
|
2019
|
Domingos Dellamonica
Vojtěch Rödl
|
+
|
Increasing paths in countable graphs
|
2019
|
Andrii Arman
Bradley Elliott
Vojtěch Rödl
|
+
|
Extractors for small zero-fixing sources
|
2019
|
Pavel Pudlák
Vojtěch Rödl
|
+
PDF
Chat
|
Embedding hypertrees into steiner triple systems
|
2018
|
Bradley Elliott
Vojtěch Rödl
|
+
|
The size Ramsey number of short subdivisions of bounded degree graphs
|
2018
|
Yoshiharu Kohayakawa
Troy Retter
Vojtěch Rödl
|
+
PDF
Chat
|
Some Remarks on π
|
2018
|
Christian Reiher
Vojtěch Rödl
Mathias Schacht
|
+
PDF
Chat
|
Borsuk and Ramsey Type Questions in Euclidean Space
|
2018
|
Péter Frankl
János Pach
Christian Reiher
Vojtěch Rödl
|
+
PDF
Chat
|
On a Turán problem in weakly quasirandom 3-uniform hypergraphs
|
2018
|
Christian Reiher
Vojtěch Rödl
Mathias Schacht
|
+
|
Infinite Sidon Sets Contained in Sparse Random Sets of Integers
|
2018
|
Yoshiharu Kohayakawa
Sang June Lee
Carlos Gustavo Moreira
Vojtěch Rödl
|
+
|
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs
|
2018
|
Hiệp Hàn
Vojtěch Rödl
Tibor Szabó
|
+
PDF
Chat
|
The Minimum Number of Edges in Uniform Hypergraphs with Property O
|
2017
|
Dwight Duffus
Bill Kay
Vojtěch Rödl
|
+
PDF
|
The number of Bh‐sets of a given cardinality
|
2017
|
Domingos Dellamonica
Yoshiharu Kohayakawa
Sang June Lee
Vojtěch Rödl
Wojciech Samotij
|
+
|
Note on a Ramsey Theorem for Posets with Linear Extensions
|
2017
|
Andrii Arman
Vojtěch Rödl
|
+
PDF
Chat
|
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
|
2017
|
Christian Reiher
Vojtěch Rödl
Mathias Schacht
|
+
|
An algorithmic hypergraph regularity lemma
|
2017
|
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
|
+
PDF
|
A Ramsey class for Steiner systems
|
2017
|
Vindya Bhat
Jaroslav Nešetřil
Christian Reiher
Vojtěch Rödl
|
+
PDF
Chat
|
Ramsey Partial Orders from Acyclic Graphs
|
2017
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
PDF
Chat
|
On the Hamiltonicity of Triple Systems with High Minimum Degree
|
2017
|
Vojtěch Rödl
Andrzej Ruciński
Mathias Schacht
Endre Szemerédi
|
+
PDF
|
On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
|
2017
|
Christian Reiher
Vojtěch Rödl
Mathias Schacht
|
+
PDF
Chat
|
On the Size‐Ramsey Number of Hypergraphs
|
2017
|
Andrzej Dudek
Steven La Fleur
Dhruv Mubayi
Vojtěch Rödl
|
+
|
Statistics of orderings
|
2017
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
A Note on Induced Ramsey Numbers
|
2017
|
David Conlon
Domingos Dellamonica
Steven La Fleur
Vojtěch Rödl
Mathias Schacht
|
+
PDF
|
Hedgehogs are not colour blind
|
2017
|
David Conlon
Jacob Fox
Vojtěch Rödl
|
+
|
Ramsey properties of random graphs and Folkman numbers
|
2017
|
Vojtěch Rödl
Andrzej Ruciński
Mathias Schacht
|
+
|
Borsuk and Ramsey type questions in Euclidean space
|
2017
|
Péter Frankl
János Pach
Christian Reiher
Vojtěch Rödl
|
+
|
The chromatic number of finite type-graphs
|
2016
|
Christian Avart
Bill Kay
Christian Reiher
Vojtěch Rödl
|
+
|
Short Proof of Erdős Conjecture for Triple Systems
|
2016
|
Péter Frankl
Vojtěch Rödl
Andrzej Ruciński
|
+
PDF
Chat
|
Discrepancy and eigenvalues of Cayley graphs
|
2016
|
Yoshiharu Kohayakawa
Vojtěch Rödl
Mathias Schacht
|
+
|
The Minimum Number of Edges in Uniform Hypergraphs with Property O
|
2016
|
Dwight Duffus
Bill Kay
Vojtěch Rödl
|
+
|
Note on Ramsey theorem for posets with linear extensions
|
2016
|
Andrii Arman
Vojtěch Rödl
|
+
|
Ramsey Partial Orders from Acyclic Graphs
|
2016
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
PDF
Chat
|
Embedding tetrahedra into quasirandom hypergraphs
|
2016
|
Christian Reiher
Vojtěch Rödl
Mathias Schacht
|
+
PDF
Chat
|
An exponential-type upper bound for Folkman numbers
|
2016
|
Vojtěch Rödl
Andrzej Ruciński
Mathias Schacht
|
+
PDF
Chat
|
Packing minor-closed families of graphs into complete graphs
|
2016
|
Silvia Messuti
Vojtěch Rödl
Mathias Schacht
|
+
|
The number of B3-sets of a given cardinality
|
2016
|
Domingos Dellamonica
Yoshiharu Kohayakawa
Sang June Lee
Vojtěch Rödl
Wojciech Samotij
|
+
|
Isomorphic edge disjoint subgraphs of hypergraphs
|
2016
|
Paul Horn
Vácłav Koubek
Vojtěch Rödl
|
+
PDF
Chat
|
The complexity of proving that a graph is Ramsey
|
2016
|
Massimo Lauria
Pavel Pudlák
Vojtěch Rödl
Neil Thapen
|
+
|
An algorithmic hypergraph regularity lemma
|
2016
|
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
|
+
|
Short Proof of Erd\H os Conjecture for Triple Systems
|
2016
|
Péter Frankl
Vojtěch Rödl
Andrzej Ruciński
|
+
|
The Minimum Number of Edges in Uniform Hypergraphs with Property O
|
2016
|
Dwight Duffus
Bill Kay
Vojtěch Rödl
|
+
|
Ramsey Partial Orders from Acyclic Graphs
|
2016
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Note on Ramsey theorem for posets with linear extensions
|
2016
|
Andrii Arman
Vojtěch Rödl
|
+
|
An Algorithmic Hypergraph Regularity Lemma
|
2015
|
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
|
+
PDF
Chat
|
Hypergraph Ramsey numbers: tight cycles versus cliques
|
2015
|
Dhruv Mubayi
Vojtěch Rödl
|
+
PDF
|
Ramsey-type numbers involving graphs and hypergraphs with large girth
|
2015
|
Hiệp Hàn
Troy Retter
Vojtěch Rödl
Mathias Schacht
|
+
|
A short proof of the induced Ramsey Theorem for hypergraphs
|
2015
|
Vindya Bhat
Vojtěch Rödl
|
+
|
Hedgehogs are not colour blind
|
2015
|
David Conlon
Jacob Fox
Vojtěch Rödl
|
+
PDF
|
Packing minor closed families of graphs
|
2015
|
Silvia Messuti
Vojtěch Rödl
Mathias Schacht
|
+
|
On the Number of<i>B<sub>h</sub></i>-Sets
|
2015
|
Domingos Dellamonica
Yoshiharu Kohayakawa
Sang June Lee
Vojtěch Rödl
Wojciech Samotij
|
+
|
A note on supersaturated set systems
|
2015
|
Péter Frankl
Yoshiharu Kohayakawa
Vojtěch Rödl
|
+
|
On the size-Ramsey number of hypergraphs
|
2015
|
Andrzej Dudek
Steven La Fleur
Dhruv Mubayi
Vojtěch Rödl
|
+
|
On induced Ramsey numbers for<i>k</i>-uniform hypergraphs
|
2015
|
Domingos Dellamonica
Steven La Fleur
Vojtěch Rödl
|
+
|
Near-optimum universal graphs for graphs with bounded degrees (Extended abstract)
|
2015
|
Noga Alon
Michael Capalbo
Yoshiharu Kohayakawa
Vojtěch Rödl
Andrzej Ruciński
Endre Szemerédi
|
+
|
On the size-Ramsey number of hypergraphs
|
2015
|
Andrzej Dudek
Steven La Fleur
Dhruv Mubayi
Vojtěch Rödl
|
+
|
Hedgehogs are not colour blind
|
2015
|
David Conlon
Jacob Fox
Vojtěch Rödl
|
+
|
On generalized Ramsey numbers of Erdős and Rogers
|
2014
|
Andrzej Dudek
Troy Retter
Vojtěch Rödl
|
+
|
An improved upper bound on the density of universal random graphs
|
2014
|
Domingos Dellamonica
Yoshiharu Kohayakawa
Vojtěch Rödl
Andrzej Ruciński
|
+
|
An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions
|
2014
|
Domingos Dellamonica
Subrahmanyam Kalyanasundaram
Daniel M. Martin
Vojtěch Rödl
A. Shapira
|
+
PDF
|
Degree Ramsey Numbers of Closed Blowups of Trees
|
2014
|
Paul Horn
Kevin G. Milans
Vojtěch Rödl
|
+
|
Families of triples with high minimum degree are Hamiltonian
|
2014
|
Vojtěch Rödl
Andrzej Ruciński
|
+
PDF
|
On generalized shift graphs
|
2014
|
Christian Avart
Tomasz Łuczak
Vojtěch Rödl
|
+
PDF
|
Note on Upper Density of Quasi-Random Hypergraphs
|
2013
|
Vindya Bhat
Vojtěch Rödl
|
+
|
Specified intersections
|
2013
|
Dhruv Mubayi
Vojtěch Rödl
|
+
PDF
|
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
|
2013
|
Yoshiharu Kohayakawa
Sang June Lee
Vojtěch Rödl
Wojciech Samotij
|
+
|
Note on the point character of l 1-spaces
|
2013
|
Christian Avart
Péter Komjáth
Vojtěch Rödl
|
+
|
The complexity of proving that a graph is Ramsey
|
2013
|
Massimo Lauria
Pavel Pudlák
Vojtěch Rödl
Neil Thapen
|
+
PDF
Chat
|
Extremal Results in Random Graphs
|
2013
|
Vojtěch Rödl
Mathias Schacht
|
+
|
Arrangeability and Clique Subdivisions
|
2013
|
Vojtěch Rödl
Robin Thomas
|
+
|
Jumps and Nonjumps in Multigraphs
|
2013
|
Paul Horn
Steve La Fleur
Vojtěch Rödl
|
+
PDF
Chat
|
The Complexity of Proving That a Graph Is Ramsey
|
2013
|
Massimo Lauria
Pavel Pudlák
Vojtěch Rödl
Neil Thapen
|
+
|
The complexity of proving that a graph is Ramsey.
|
2013
|
Massimo Lauria
Pavel Pudlák
Vojtěch Rödl
Neil Thapen
|
+
|
The complexity of proving that a graph is Ramsey
|
2013
|
Massimo Lauria
Pavel Pudlák
Vojtěch Rödl
Neil Thapen
|
+
PDF
|
Complete Partite subgraphs in dense hypergraphs
|
2012
|
Vojtěch Rödl
Mathias Schacht
|
+
|
On Subgraphs of Large Girth
|
2012
|
Vojtěch Rödl
|
+
PDF
|
Distance Preserving Ramsey Graphs
|
2012
|
Domingos Dellamonica
Vojtěch Rödl
|
+
|
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels
|
2012
|
Noga Alon
Péter Frankl
Hao Huang
Vojtěch Rödl
Andrzej Ruciński
Benny Sudakov
|
+
|
On induced Folkman numbers
|
2012
|
Andrzej Dudek
Reshma Ramadurai
Vojtěch Rödl
|
+
|
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
|
2012
|
Péter Frankl
Vojtěch Rödl
Andrzej Ruciński
|
+
|
An Improved Upper Bound on the Density of Universal Random Graphs
|
2012
|
Domingos Dellamonica
Yoshiharu Kohayakawa
Vojtěch Rödl
Andrzej Ruciński
|
+
PDF
|
A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma
|
2012
|
Domingos Dellamonica
Subrahmanyam Kalyanasundaram
Daniel M. Martin
Vojtěch Rödl
A. Shapira
|
+
PDF
|
Universality of Random Graphs
|
2012
|
Domingos Dellamonica
Yoshiharu Kohayakawa
Vojtěch Rödl
Andrzej Ruciński
|
+
|
Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels
|
2011
|
Noga Alon
Péter Frankl
Hao Huang
Vojtěch Rödl
Andrzej Ruciński
Benny Sudakov
|
+
|
Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs
|
2011
|
Vojtěch Rödl
Andrzej Ruciński
Endre Szemerédi
|
+
|
A note on Thomassenʼs conjecture
|
2011
|
Domingos Dellamonica
Vojtěch Rödl
|
+
|
Hereditary quasirandom properties of hypergraphs
|
2011
|
Domingos Dellamonica
Vojtěch Rödl
|
+
|
Sparse partition universal graphs for graphs of bounded degree
|
2011
|
Yoshiharu Kohayakawa
Vojtěch Rödl
Mathias Schacht
Endre Szemerédi
|
+
|
The maximum size of a Sidon set contained in a sparse random set of integers
|
2011
|
Yoshiharu Kohayakawa
SangJune Lee
Vojtěch Rödl
|
+
|
The maximum size of a Sidon set contained in a sparse random set of integers
|
2011
|
Yoshiharu Kohayakawa
SangJune Lee
Vojtěch Rödl
|
+
|
On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers
|
2011
|
Andrzej Dudek
Vojtěch Rödl
|
+
PDF
|
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
|
2011
|
Domingos Dellamonica
Subrahmanyam Kalyanasundaram
Daniel M. Martin
Vojtěch Rödl
A. Shapira
|
+
|
Specified Intersections
|
2011
|
Dhruv Mubayi
Vojtěch Rödl
|
+
|
Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels
|
2011
|
Noga Alon
Péter Frankl
Hao Huang
Vojtěch Rödl
Andrzej Ruciński
Benny Sudakov
|
+
|
On a conjecture of Thomassen concerning subgraphs of large girth
|
2010
|
Domingos Dellamonica
Vácłav Koubek
Daniel M. Martin
Vojtěch Rödl
|
+
|
On the Function of Erdős and Rogers
|
2010
|
Andrzej Dudek
Vojtěch Rödl
|
+
|
Ramsey properties of random discrete structures
|
2010
|
Ehud Friedgut
Vojtěch Rödl
Mathias Schacht
|
+
|
Some recent results on Ramsey-type numbers
|
2010
|
Andrzej Dudek
Péter Frankl
Vojtěch Rödl
|
+
|
Some constructive bounds on Ramsey numbers
|
2010
|
Alexandr Kostochka
Pavel Pudlák
Vojtěch Rödl
|
+
|
Regularity Lemmas for Graphs
|
2010
|
Vojtěch Rödl
Mathias Schacht
|
+
PDF
|
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
|
2010
|
Noga Alon
Amin Coja‐Oghlan
Hiệp Hàn
Mihyun Kang
Vojtěch Rödl
Mathias Schacht
|
+
|
Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)
|
2010
|
Vojtěch Rödl
Andrzej Ruciński
|
+
|
A theorem on incidence matrices and quasirandom hypergraphs
|
2010
|
Domingos Dellamonica
Péter Frankl
Vojtěch Rödl
|
+
PDF
|
Coloring Uniform Hypergraphs with Small Edge Degrees
|
2010
|
Alexandr Kostochka
Vojtěch Rödl
Mohit Kumbhat
|
+
|
REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS
|
2009
|
Vácłav Koubek
Vojtěch Rödl
Benjamin Shemmer
|
+
PDF
|
Hereditary quasi-random properties of hypergraphs
|
2009
|
Domingos Dellamonica
Vojtěch Rödl
|
+
|
Generalizations of the removal lemma
|
2009
|
Vojtěch Rödl
Mathias Schacht
|
+
|
Note on asymptotically good packings
|
2009
|
Daniel M. Martin
Vojtěch Rödl
|
+
|
Weak hypergraph regularity and linear hypergraphs
|
2009
|
Yoshiharu Kohayakawa
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
|
+
PDF
|
An almost quadratic bound on vertex Folkman numbers
|
2009
|
Andrzej Dudek
Vojtěch Rödl
|
+
PDF
|
On Colourings of Hypergraphs Without Monochromatic Fano Planes
|
2009
|
Hanno Lefmann
Yury Person
Vojtěch Rödl
Mathias Schacht
|
+
|
A Note on Universal and Canonically Coloured Sequences
|
2009
|
Andrzej Dudek
Péter Frankl
Vojtěch Rödl
|
+
|
On the number of graphs with a given endomorphism monoid
|
2009
|
Vácłav Koubek
Vojtěch Rödl
|
+
|
On graphs with a given endomorphism monoid
|
2009
|
Vácłav Koubek
Vojtěch Rödl
Benjamin Shemmer
|
+
PDF
|
Cliques in Steiner systems
|
2009
|
Andrzej Dudek
František Franěk
Vojtěch Rödl
|
+
|
Hypergraph regularity and quasi-randomness
|
2009
|
Brendan Nagle
Annika Poerschke
Vojtěch Rödl
Mathias Schacht
|
+
|
Hypergraph regularity and quasi-randomness
|
2009
|
Brendan Nagle
Annika Poerschket
Vojtěch Rödl
Mathias Schacht
|
+
|
Some recollections on early work with Jan Pelant
|
2008
|
Veronika Müller
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
None
|
2008
|
Vojtěch Rödl
J Zich
|
+
|
Perfect matchings in large uniform hypergraphs with large minimum collective degree
|
2008
|
Vojtěch Rödl
Andrzej Ruciński
Endre Szemerédi
|
+
PDF
|
Triangulations and the Hajós conjecture
|
2008
|
Vojtěch Rödl
J Zich
|
+
|
On the Ramsey Number of Sparse 3-Graphs
|
2008
|
Brendan Nagle
Sayaka Olsen
Vojtěch Rödl
Mathias Schacht
|
+
|
On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-chromatically connected graphs
|
2008
|
Andrzej Dudek
Esmeralda Năstase
Vojtěch Rödl
|
+
|
New Upper Bound on Vertex Folkman Numbers
|
2008
|
Andrzej Dudek
Vojtěch Rödl
|
+
PDF
|
On the Turán Properties of Infinite Graphs
|
2008
|
Andrzej Dudek
Vojtěch Rödl
|
+
|
An approximate Dirac-type theorem for k-uniform hypergraphs
|
2008
|
Vojtěch Rödl
Endre Szemerédi
Andrzej Ruciński
|
+
PDF
|
Finding Folkman Numbers via MAX CUT Problem
|
2008
|
Andrzej Dudek
Vojtěch Rödl
|
+
|
Universality of random graphs
|
2008
|
Domingos Dellamonica
Yoshiharu Kohayakawa
Vojtěch Rödl
Andrzej Ruciński
|
+
|
A note on perfect matchings in uniform hypergraphs with large minimum collective degree
|
2008
|
Vojtěch Rödl
Andrzej Ruciński
Mathias Schacht
Endre Szemerédi
|
+
PDF
|
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
|
2007
|
Noga Alon
Amin Coja‐Oghlan
Hiệp Hàn
Mihyun Kang
Vojtěch Rödl
Mathias Schacht
|
+
PDF
|
Regular Partitions of Hypergraphs: Regularity Lemmas
|
2007
|
Vojtěch Rödl
Mathias Schacht
|
+
PDF
|
Regular Partitions of Hypergraphs: Counting Lemmas
|
2007
|
Vojtěch Rödl
Mathias Schacht
|
+
|
Chromatic Numbers and Homomorphisms of Large Girth Hypergraphs
|
2007
|
Dwight Duffus
Vojtěch Rödl
Bill Sands
Norbert Sauer
|
+
|
Extremal Hypergraph Problems and the Regularity Method
|
2007
|
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
|
+
|
Turán's theorem for pseudo-random graphs
|
2007
|
Yoshiharu Kohayakawa
Vojtěch Rödl
Mathias Schacht
Papa A. Sissokho
Jozef Skokan
|
+
|
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
|
2007
|
Vojtěch Rödl
Andrzej Ruciński
Mathias Schacht
|
+
|
Every Monotone 3‐Graph Property is Testable
|
2007
|
Christian Avart
Vojtěch Rödl
Mathias Schacht
|
+
|
Perfect matchings in uniform hypergraphs with large minimum degree
|
2006
|
Vojtěch Rödl
Andrzej Ruciński
Endre Szemerédi
|
+
|
A note on the jumping constant conjecture of Erdős
|
2006
|
Péter Frankl
Yuejian Peng
Vojtěch Rödl
John Talbot
|
+
PDF
|
Supersaturation For Ramsey-Turán Problems
|
2006
|
Dhruv Mubayi
Vojtěch Rödl
|
+
|
On the chromatic number and independence number of hypergraph products
|
2006
|
Dhruv Mubayi
Vojtěch Rödl
|
+
PDF
|
Small subsets inherit sparse ε-regularity
|
2006
|
Stefanie Gerke
Yoshiharu Kohayakawa
Vojtěch Rödl
Angelika Steger
|
+
|
Applications of the regularity lemma for uniform hypergraphs
|
2006
|
Vojtěch Rödl
Jozef Skokan
|
+
|
The counting lemma for regular k-uniform hypergraphs
|
2006
|
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
|
+
|
Short paths in quasi-random triple systems with sparse underlying graphs
|
2006
|
Joanna Polcyn
Vojtěch Rödl
Andrzej Ruciński
Endre Szemerédi
|
+
PDF
|
The counting lemma for regular <i>k</i>‐uniform hypergraphs
|
2006
|
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
|
+
|
A Dirac-Type Theorem for 3-Uniform Hypergraphs
|
2006
|
Vojtěch Rödl
Andrzej Ruciński
Endre Szemerédi
|
+
|
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
|
2006
|
Ehud Friedgut
Vojtěch Rödl
Andrzej Ruciński
Prasad Tetali
|
+
PDF
|
Applications of the regularity lemma for uniform hypergraphs
|
2005
|
Vojtěch Rödl
Jozef Skokan
|
+
|
Sharp Bounds For Some Multicolor Ramsey Numbers
|
2005
|
Noga Alon
Vojtěch Rödl
|
+
PDF
|
The Generalization of Dirac’s Theorem for Hypergraphs
|
2005
|
Endre Szemerédi
Andrzej Ruciński
Vojtěch Rödl
|
+
PDF
|
Counting subgraphs in quasi‐random 4‐uniform hypergraphs
|
2005
|
Vojtěch Rödl
Jozef Skokan
|
+
PDF
|
Strong ramsey properties of simplices
|
2004
|
Péter Frankl
Vojtěch Rödl
|
+
PDF
|
Uniform Edge Distribution in Hypergraphs is Hereditary
|
2004
|
Dhruv Mubayi
Vojtěch Rödl
|
+
|
Regularity Lemma for k‐uniform hypergraphs
|
2004
|
Vojtěch Rödl
Jozef Skokan
|
+
|
The Turn Theorem for Random Graphs
|
2004
|
Yoshiharu Kohayakawa
Vojtěch Rödl
Mathias Schacht
|
+
PDF
|
Ramsey Games Against a One-Armed Bandit
|
2003
|
Ehud Friedgut
Yoshiharu Kohayakawa
Vojtěch Rödl
Andrzej Ruciński
Prasad Tetali
|
+
|
On large intersecting subfamilies of uniform setfamilies
|
2003
|
Richard A. Duke
Paul Erdös
Vojtěch Rödl
|
+
PDF
|
Regularity properties for triple systems
|
2003
|
Brendan Nagle
Vojtěch Rödl
|
+
|
Independent Deuber sets in graphs on the natural numbers
|
2003
|
David S. Gunderson
Imre Leader
Hans Jürgen Prömel
Vojtěch Rödl
|
+
|
On homogeneous sets of positive integers
|
2003
|
Vojtěch Rödl
|
+
PDF
|
Integer and fractional packings in dense 3‐uniform hypergraphs
|
2003
|
Penny Haxell
Brendan Nagle
Vojtěch Rödl
|
+
|
Light spanners and sparse pseudo-random graphs
|
2003
|
Papa A. Sissokho
Michelangelo Grigni
Vojtěch Rödl
|
+
|
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
|
2003
|
Ehud Friedgut
Vojtěch Rödl
Andrzej Ruciński
Prasad Tetali
|
+
|
Measures of pseudorandomness for finite sequences :: minimum and typical values
|
2003
|
Yoshiharu Kohayakawa
Carlos Gustavo Moreira
Vojtěch Rödl
Christian Mauduit
|
+
|
Ramsey Properties of Families of Graphs
|
2002
|
Ronald Graham
Tomasz Łuczak
Vojtěch Rödl
Andrzej Ruciński
|
+
|
On the Turán Number of Triple Systems
|
2002
|
Dhruv Mubayi
Vojtěch Rödl
|
+
|
Extremal problems on set systems
|
2002
|
Péter Frankl
Vojtěch Rödl
|
+
|
Extremal problems on set systems
|
2002
|
Péter Frankl
Vojtěch Rödl
|
+
|
Hypergraphs, Quasi-randomness, and Conditions for Regularity
|
2002
|
Yoshiharu Kohayakawa
Vojtěch Rödl
Jozef Skokan
|
+
|
On an anti-Ramsey type result
|
2002
|
Noga Alon
Hanno Lefmann
Vojtěch Rödl
|
+
|
Efficient Testing of Hypergraphs
|
2002
|
Yoshiharu Kohayakawa
Brendan Nagle
Vojtech Rödl
|
+
|
Proof of a hypercontractive estimate via entropy
|
2001
|
Ehud Friedgut
Vojtěch Rödl
|
+
PDF
|
Holes in Graphs
|
2001
|
Yuejian Peng
Vojtěch Rödl
Andrzej Ruciński
|
+
PDF
|
On the chromatic number of set systems
|
2001
|
Alexandr Kostochka
Dhruv Mubayi
Vojtěch Rödl
Prasad Tetali
|
+
PDF
|
The asymptotic number of triple systems not containing a fixed one
|
2001
|
Brendan Nagle
Vojtěch Rödl
|
+
PDF
|
Near-optimum Universal Graphs for Graphs with Bounded Degrees
|
2001
|
Noga Alon
Michael Capalbo
Yoshiharu Kohayakawa
Vojtěch Rödl
Andrzej Ruciński
Endre Szemerédi
|
+
|
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers
|
2001
|
David S. Gunderson
Imre Leader
Hans Jürgen Prömel
Vojtěch Rödl
|
+
|
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma
|
2001
|
Vojtěch Rödl
Andrzej Ruciński
Michelle Wagner
|
+
|
On Size Ramsey Numbers of Graphs with Bounded Degree
|
2000
|
Vojtěch Rödl
Endre Szemerédi
|
+
|
An Algorithmic Regularity Lemma for Hypergraphs
|
2000
|
Andrzej Czygrinow
Vojtěch Rödl
|
+
|
Non-Ramsey Graphs Are clogn-Universal
|
1999
|
Hans Jürgen Prömel
Vojtěch Rödl
|
+
|
Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs
|
1999
|
David S. Gunderson
Vojtěch Rödl
Alexander Sidorenko
|
+
|
Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma
|
1999
|
Vojtěch Rödl
Andrzej Ruciński
|
+
|
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
|
1998
|
Tomasz Łuczak
Vojtěch Rödl
Endre Szemerédi
|
+
|
Perfect matchings in ε-regular graphs
|
1998
|
Noga Alon
Vojtěch Rödl
Andrzej Ruciński
|
+
|
Proper Bounded Edge-Colorings
|
1998
|
Claudia Bertram‐Kretzberg
Hanno Lefmann
Vojtěch Rödl
Beata Wysocka
|
+
|
Extremal Problems for Affine Cubes of Integers
|
1998
|
David S. Gunderson
Vojtěch Rödl
|
+
|
Endomorphisms of Partially Ordered Sets
|
1998
|
Dwight Duffus
Tomasz Łuczak
Vojtěch Rödl
Andrzej Ruciński
|
+
PDF
|
Perfect Matchings in $\epsilon$-regular Graphs
|
1998
|
Noga Alon
Vojtěch Rödl
Andrzej Ruciński
|
+
|
Independent finite sums in graphs defined on the natural numbers
|
1998
|
Tomasz Łuczak
Vojtěch Rödl
Tomasz Schoen
|
+
|
An Algorithmic Embedding of Graphs via Perfect Matchings
|
1998
|
Vojtěch Rödl
Andrzej Ruciński
Michelle Wagner
|
+
|
Ramsey Properties of Random Hypergraphs
|
1998
|
Vojtěch Rödl
Andrzej Ruciński
|
+
|
Perfect matchings in -regular graphs.
|
1998
|
Noga Alon
Beverly Sackler
Vojtěch Rödl
Andrzej Ruci
|
+
|
On the Size of Set Systems on [n] Not Containing Weak (r,Δ)-Systems
|
1997
|
Vojtěch Rödl
Luboš Thoma
|
+
|
Bipartite Coverings of Graphs
|
1997
|
Vojtěch Rödl
Andrzej Ruciński
|
+
|
Note on regular subgraphs
|
1997
|
Vojtěch Rödl
Beata Wysocka
|
+
|
Chromatic Ramsey Theory
|
1997
|
Norbert Sauer
Robert E. Woodrow
Vojtěch Rödl
|
+
|
Arrangeability and Clique Subdivisions
|
1997
|
Vojtěch Rödl
Robin Thomas
|
+
|
On Schur Properties of Random Subsets of Integers
|
1996
|
Ronald Graham
Vojtěch Rödl
Andrzej Ruciński
|
+
|
Multicolored Subsets in Colored Hypergraphs
|
1996
|
Hanno Lefmann
Vojtěch Rödl
Beata Wysocka
|
+
|
Ramsey-type results for oriented trees
|
1996
|
Yoshiharu Kohayakawa
Tomasz Łuczak
Vojtěch Rödl
|
+
|
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree
|
1996
|
Tomasz Łuczak
Vojtěch Rödl
|
+
PDF
|
Arithmetic progressions of length three in subsets of a random set
|
1996
|
Yoshiharu Kohayakawa
Tomasz Łuczak
Vojtěch Rödl
|
+
|
On the computational complexity of ordered subgraph recognition
|
1995
|
Dwight Duffus
Mark Ginn
Vojtěch Rödl
|
+
|
Threshold Functions for Ramsey Properties
|
1995
|
Vojtěch Rödl
Andrzej Ruciński
|
+
|
On Ramsey sets in spheres
|
1995
|
Jiřı́ Matoušek
Vojtěch Rödl
|
+
|
On Erdős-Rado numbers
|
1995
|
Hanno Lefmann
Vojtěch Rödl
|
+
|
On uncrowded hypergraphs
|
1995
|
Richard A. Duke
Hanno Lefmann
Vojtěch Rödl
|
+
|
Coverings of r—graphs by complete r—partite subgraphs
|
1995
|
P. Erdős
Vojtěch Rödl
|
+
|
On the jumping constant conjecture for multigraphs
|
1995
|
Vojtěch Rödl
Alexander Sidorenko
|
+
|
On the genus of a random graph
|
1995
|
Vojtěch Rödl
Robin Thomas
|
+
|
Shift graphs and lower bounds on Ramsey numbers rk(l; r)
|
1995
|
Dwight Duffus
Hannon Lefmann
Vojtěch Rödl
|
+
PDF
|
Threshold functions for Ramsey properties
|
1995
|
Vojtěch Rödl
Andrzej Ruciński
|
+
|
Note on Ramsey numbers and self-complementary graphs
|
1995
|
Vojtěch Rödl
Edita Šiňajová
|
+
|
Random graphs with monochromatic triangles in every edge coloring
|
1994
|
Vojtěch Rödl
Andrzej Ruciński
|
+
|
Unbalanced steiner triple systems
|
1994
|
Lucien Haddad
Vojtěch Rödl
|
+
|
The Erdős—Ko—Rado theorem for small families
|
1994
|
Richard A. Duke
Vojtěch Rödl
|
+
|
Note on independent sets in steiner systems
|
1994
|
Vojtěch Rödl
Edita Šiňajová
|
+
|
On isomorphic subgraphs
|
1993
|
Ronald J. Gould
Vojtěch Rödl
|
+
|
On Canonical Ramsey Numbers for Coloring Three-Element Sets
|
1993
|
Hanno Lefmann
Vojtěch Rödl
|
+
|
Extremal problems for triple systems
|
1993
|
Hanno Lefmann
Kevin T. Phelps
Vojtěch Rödl
|
+
|
Cycle-connected graphs
|
1992
|
Richard A. Duke
P. Erdős
Vojtěch Rödl
|
+
|
On coverings of infinite- dimentional metric spaces
|
1992
|
Jan Pelant
Vojtěch Rödl
|
+
|
On Ramsey graphs without bipartite subgraphs
|
1992
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
A Canonical Ramsey Theorem
|
1992
|
Nancy Eaton
Vojtěch Rödl
|
+
|
Rainbow subgraphs in properly edge‐colored graphs
|
1992
|
Vojtěch Rödl
Źsolt Tuza
|
+
|
Enumeration of order preserving maps
|
1992
|
Dwight Duffus
Vojtěch Rödl
Bill Sands
Robert E. Woodrow
|
+
|
On the dimension to represent a graph by a unit distance graph
|
1990
|
Hiroshi Maehara
Vojtěch Rödl
|
+
|
Introduction Ramsey Theory Old and New
|
1990
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Mathematics of Ramsey Theory
|
1990
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Partite Construction and Ramsey Space Systems
|
1990
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
On Pisier Type Problems and Results (Combinatorial Applications to Number Theory)
|
1990
|
Paul Erdös
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
A Ramsey-Type Theorem for Orderings of a Graph
|
1989
|
Vojtěch Rödl
Peter Winkler
|
+
|
The partite construction and ramsey set systems
|
1989
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Complexity of diagrams
|
1987
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Strong Ramsey Theorems for Steiner Systems
|
1987
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
PDF
|
Forbidden Intersections
|
1987
|
Péter Frankl
Vojtěch Rödl
|
+
PDF
|
Strong Ramsey theorems for Steiner systems
|
1987
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Partite construction and Ramseyan theorems for sets, numbers and spaces
|
1987
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
PDF
|
Forbidden intersections
|
1987
|
Péter Frankl
Vojtěch Rödl
|
+
|
Large triangle-free subgraphs in graphs withoutK 4
|
1986
|
Péter Frankl
Vojtěch Rödl
|
+
|
Coloring of universal graphs
|
1986
|
Péter Komjáth
Vojtěch Rödl
|
+
|
Finite union theorem with restrictions
|
1986
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
On sets of integers with the Schur property
|
1986
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
PDF
|
All Triangles are Ramsey
|
1986
|
Péter Frankl
Vojtěch Rödl
|
+
|
Note on decomposition of spheres in Hilbert spaces
|
1986
|
David Preiss
Vojtěch Rödl
|
+
|
An elementary proof of the canonizing version of Gallai-Witt's theorem
|
1986
|
Hans Jürgen Prömel
Vojtěch Rödl
|
+
|
On universality of graphs with uniformly distributed edges
|
1986
|
V. Rödl
|
+
PDF
|
All triangles are Ramsey
|
1986
|
Péter Frankl
Vojtěch Rödl
|
+
|
Note on a Ramsey-Turán type problem
|
1985
|
Vojtěch Rödl
|
+
|
Lower bounds for Turán's problem
|
1985
|
Péter Frankl
Vojtěch Rödl
|
+
|
On color critical graphs
|
1985
|
Vojtěch Rödl
Źsolt Tuza
|
+
|
Two remarks on Ramsey's theorem
|
1985
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Threshold hypergraphs
|
1985
|
Jan Reiterman
Vojtěch Rödl
Edita Šiňajová
Miroslav Tůma
|
+
|
On the use of senders in generalized ramsey theory for graphs
|
1985
|
Stefan Burr
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Three Remarks on Dimensions of Graphs
|
1985
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
PDF
|
Two proofs in combinatorial number theory
|
1985
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Note on the number of monoids of order $n$
|
1985
|
Vácłav Koubek
Vojtěch Rödl
|
+
|
Two Proofs in Combinatorial Number Theory
|
1985
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
On combinatorial properties of spheres in euclidean spaces
|
1984
|
Vojtěch Rödl
|
+
|
Hypergraphs do not jump
|
1984
|
Péter Frankl
Vojtěch Rödl
|
+
|
On the minimum order of graphs with given semigroup
|
1984
|
Vácłav Koubek
Vojtěch Rödl
|
+
|
Sparse ramsey graphs
|
1984
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Combinatorial partitions of finite posets and lattices —Ramsey lattices
|
1984
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Ramsey classes of set systems
|
1983
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Products of graphs and their applications
|
1983
|
Jaroslaw Nešetřil
Vojtěch Rödl
|
+
|
Another proof of the Folkman-Rado-Sanders theorem
|
1983
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
On a problem in combinatorial geometry
|
1983
|
Vojtěch Rödl
|
+
PDF
|
On classes of graphs determined by forbidden subgraphs
|
1983
|
Svatopluk Poljak
Vojtěch Rödl
|
+
|
Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs
|
1982
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Nearly bipartite graphs with large chromatic number
|
1982
|
Vojtěch Rödl
|
+
|
Coloring Steiner Triple Systems
|
1982
|
Marcia DE Brandes
Kevin T. Phelps
Vojtěch Rödl
|
+
|
On coverings of random graphs
|
1982
|
Miklós Ajtai
János Komlós
Vojtěch Rödl
Endre Szemerédi
|
+
|
Complexity of representation of graphs by set systems
|
1981
|
Svatopluk Poljak
Vojtěch Rödl
Daniel Turzík
|
+
|
Simple proof of the existence of restricted ramsey graphs by means of a partite construction
|
1981
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
On set systems determined by intersections
|
1981
|
Svatopluk Poljak
Vojtěch Rödl
|
+
PDF
|
Orthogonal partitions and covering of graphs
|
1980
|
Svatopluk Poljak
Vojtěch Rödl
|
+
|
A short proof of the existence of highly chromatic hypergraphs without short cycles
|
1979
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
PDF
|
Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs
|
1979
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
On Ramsey graphs without cycles of short odd lengths
|
1979
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Selective Graphs and Hypergraphs
|
1978
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
PDF
|
On a probabilistic graph-theoretical method
|
1978
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
|
1978
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
Partitions of finite relational and set systems
|
1977
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
PDF
|
A structural generalization of the Ramsey theorem
|
1977
|
Jaroslav Nešetřil
Vojtěch Rödl
|
+
|
The Ramsey property for graphs with forbidden complete subgraphs
|
1976
|
Jaroslav Nešetřil
Vojtěch Rödl
|