V. Rödl

activity

20032026

most citedMinimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs

42 citations · 246 across the 38 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015

Hedgehogs are not colour blind

David Conlon, Jacob Fox, Vojtěch Rödl

We exhibit a family of $3$ -uniform hypergraphs with the property that their $2$ -colour Ramsey numbers grow polynomially in the number of vertices, while their $4$ -colour Ramsey num…

math.CO2015★ 1 cited

On the size-Ramsey number of hypergraphs

Andrzej Dudek, Steven La Fleur, Dhruv Mubayi +1

The size-Ramsey number of a graph $G$ is the minimum number of edges in a graph $H$ such that every 2-edge-coloring of $H$ yields a monochromatic copy of $G$ . Size-Ramsey numbers o…

math.CO2015★ 5 cited

Hypergraph Ramsey numbers: tight cycles versus cliques

Dhruv Mubayi, Vojtech Rodl

For $s \geq 4$ , the 3-uniform tight cycle $C_{s}^{3}$ has vertex set corresponding to $s$ distinct points on a circle and edge set given by the $s$ cyclic intervals of three consecutive…