Vojtech Rödl

collaborators

3 papers

math.CO2025

Colorings of $k$ -sets with low discrepancy on small sets

Pavel PudlÃ¡k, VojtÄch RÃ¶dl

For $0 < I^´ \leq 1$ , let $R_{k} (m; I^´)$ denote the smallest $N$ such that every coloring of $k$ -element subsets by two colors yields an $m$ -element set $M$ with relative discrepancy $I^´$ …

math.CO2025

Subgraphs with a positive minimum semidegree in digraphs with large outdegree

Andrzej Grzesik, Vojtech Rodl, Jan Volec

We prove that every $n$ -vertex directed graph $G$ with the minimum outdegree $I^´^{+} (G) = d$ contains a subgraph $H$ satisfying \[ \min\left\{Î´^+(H), Î´^-(H) \right\} \ge \frac{d(d+…

math.CO2025

The number of cliques in hypergraphs with forbidden subgraphs

Ayush Basu, Vojtech Rodl, Yi Zhao

We study the maximum number of $r$ -vertex cliques in $(r - 1)$ -uniform hypergraphs not containing complete $r$ -partite hypergraphs $K_{r}^{(r - 1)} (a_{1}, \dots, a_{r})$ . By using the hyperg…

Colorings of k-sets with low discrepancy on small sets

Subgraphs with a positive minimum semidegree in digraphs with large outdegree

The number of cliques in hypergraphs with forbidden subgraphs

Colorings of $k$ -sets with low discrepancy on small sets