Dániel Dobák

collaborators

2 papers

math.CO2026

Recursive upper bounds for the vertex online Ramsey game with applications to hypergraph Ramsey numbers

Dániel Dobák, Eion Mulrenin

The classical recursive upper bound on hypergraph Ramsey numbers due to Erdős and Rado states that for $2 \leq k < s \leq t$ , \[ r_k(s,t) \leq 2^{\binom{r_{k-1}(s-1,t-1)}{k-1}}. \]…

math.CO2026

On Ramsey number of Steiner systems

Ayush Basu, Daniel Dobak, Vojtěch Rödl +1

A $k$ -uniform hypergraph $H$ is called a partial $(k, ℓ)$ -system if every set of $ℓ$ vertices of $V (H)$ is contained in at most one edge of $H$ . We prove the existence of a pa…