List of works - Vojtěch Rödl

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph ⬇️

scholarly article from 'SIAM Journal on Computing' published in 1995

A note on supersaturated set systems ⬇️

scholarly article from 'European Journal of Combinatorics' published in 2016

A sharp threshold for random graphs with a monochromatic triangle in every edge coloring

scientific article published in 2006

An Improved Upper Bound on the Density of Universal Random Graphs ⬇️

chapter from 'LATIN 2012: Theoretical Informatics' published in 2012

An approximate Dirac-type theorem for k-uniform hypergraphs ⬇️

scholarly article from 'Combinatorica' published in 2008

An improved upper bound on the density of universal random graphs ⬇️

scholarly article from 'Random Structures & Algorithms' published in 2015

Applications of the regularity lemma for uniform hypergraphs

scholarly article by Vojtěch Rödl & Jozef Skokan published 2006 in Random Structures and Algorithms

Arithmetic progressions of length three in subsets of a random set ⬇️

scientific article published in 1996

Colorful flowers

scientific article published in 2009

Coloring graphs with locally few colors

scientific article published in April 1986

Cycle-connected graphs

Discrepancy and eigenvalues of Cayley graphs ⬇️

scholarly article from 'Czechoslovak Mathematical Journal' published in 2016

Embedding graphs with bounded degree in sparse pseudorandom graphs ⬇️

scholarly article from 'Israel Journal of Mathematics' published in 2004

Embedding tetrahedra into quasirandom hypergraphs ⬇️

scholarly article from 'arXiv:1602.02289 [math]' published in 2016

Extremal Results in Random Graphs ⬇️

chapter from 'Erdős Centennial' published in 2013

Extremal problems on set systems

scholarly article by Péter Frankl & Vojtěch Rödl published March 2002 in Random Structures and Algorithms

Hedgehogs are not colour blind

scientific article published in 2017

Hypergraph Packing and Graph Embedding ⬇️

scholarly article from 'Combinatorics, Probability and Computing' published in 1999

Infinite Sidon Sets Contained in Sparse Random Sets of Integers ⬇️

scholarly article from 'SIAM Journal on Discrete Mathematics' published in 2018

Large Triangle-Free Subgraphs in Graphs without K4

scientific article published in 1986

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels ⬇️

scholarly article from 'Journal of Combinatorial Theory, Series A' published in 2012

Measures of pseudorandomness for finite sequences: typical values

scientific article published in 2007

Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs

scientific article published in 2019

Near-optimum Universal Graphs for Graphs with Bounded Degrees ⬇️

chapter from 'Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques' published in 2001

On Bipartite Graphs with Linear Ramsey Numbers

scientific article (publication date: April 2001)

On Colourings of Hypergraphs Without Monochromatic Fano Planes ⬇️

scholarly article from 'Combinatorics, Probability and Computing' published in 2009

On K4-free subgraphs of random graphs

scientific article published in 1997

On Pisier type problems and results (Combinatorial Applications to Number Theory)

scientific article published in 1990

On Schur Properties of Random Subsets of Integers

scientific article published in 1996

On Size Ramsey Numbers of Graphs with Bounded Degree ⬇️

scholarly article from 'Combinatorica' published in 2000

On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs ⬇️

chapter from 'An Irregular Mind' published in 2010

On a Packing and Covering Problem ⬇️

scholarly article from 'European Journal of Combinatorics' published in 1985

On graphs with linear Ramsey numbers

scientific article (publication date: 2000)

On graphs with small subgraphs of large chromatic number ⬇️

scholarly article from 'Graphs and Combinatorics' published in 1985

On large intersecting subfamilies of uniform setfamilies

On subsets of abelian groups with no 3-term arithmetic progression

On the Number of Bh-Sets ⬇️

scholarly article from 'Combinatorics, Probability and Computing' published in 2016

On the arc-chromatic number of a digraph

On the dimension to represent a graph by a unit distance graph

On uncrowded hypergraphs ⬇️

scholarly article from 'Random Structures & Algorithms' published in 1995

On universality of graphs with uniformly distributed edges ⬇️

scholarly article from 'Discrete Mathematics' published in 1986

Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma ⬇️

scholarly article from 'Combinatorica' published in 1999

Quantitative Theorems for Regular Systems of Equations

scientific article published in 1988

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions ⬇️

scholarly article from 'SIAM Journal on Computing' published in 2010

Rado Partition Theorem for Random Subsets of Integers

scientific article published in 1997

Rainbow subgraphs in properly edge-colored graphs ⬇️

scholarly article from 'Random Structures & Algorithms' published in 1992

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs

scientific article published in 2007

Ramsey properties of random discrete structures

scientific article published in 2010

Regular pairs in sparse random graphs I: Regular Pairs in Sparse Random Graphs I ⬇️

scholarly article from 'Random Structures & Algorithms' published in 2003

Regularity Lemma for k-uniform hypergraphs

Selectivity of hypergraphs

scientific article published in 1984

Small subsets inherit sparse ε-regularity ⬇️

scholarly article from 'Journal of Combinatorial Theory, Series B' published in 2007

Sparse partition universal graphs for graphs of bounded degree

scientific article published in 2011

Szemerédi’s Regularity Lemma and Quasi-randomness ⬇️

chapter from 'Recent Advances in Algorithms and Combinatorics' published in 2003

The Algorithmic Aspects of the Regularity Lemma ⬇️

scholarly article from 'Journal of Algorithms' published in 1994

The Complexity of Proving That a Graph Is Ramsey

2013 scholarly article by Massimo Lauria et al. published in Combinatorica

The Ramsey number of a graph with bounded maximum degree

scientific article (publication date: June 1983)

The Turán theorem for random graphs

scientific article published in 2004

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent ⬇️

scholarly article from 'Graphs and Combinatorics' published in 1986

The complexity of proving that a graph is Ramsey

February 2016 scholarly article by Massimo Lauria et al. published in Combinatorica

The counting lemma for regulark-uniform hypergraphs

article

The maximum size of a Sidon set contained in a sparse random set of integers ⬇️

conference paper from 'Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms' published in 2011

The number of B3-sets of a given cardinality ⬇️

scholarly article from 'Journal of Combinatorial Theory, Series A' published in 2016

The number of Bh-sets of a given cardinality ⬇️

scholarly article from 'Proceedings of the London Mathematical Society' published in 2018

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers ⬇️