42 citations · 246 across the 38 of their papers we have counts for
45 papers
Regularity method for hypergraphs with -cycle-free links
Ayush Basu, Christian Reiher, Vojtěch Rödl +1
We extend the hypergraph regularity method to sparse -uniform hypergraphs whose vertex links are -free. In other words, we consider hypergraphs that are $K_{1,2,2…
Subgraphs with a positive minimum semidegree in digraphs with large outdegree
Andrzej Grzesik, Vojtech Rodl, Jan Volec
We prove that every -vertex directed graph with the minimum outdegree contains a subgraph satisfying \[ \min\left\{δ^+(H), δ^-(H) \right\} \ge \frac{d(d+1)}…
The number of cliques in hypergraphs with forbidden subgraphs
Ayush Basu, Vojtech Rodl, Yi Zhao
We study the maximum number of -vertex cliques in -uniform hypergraphs not containing complete -partite hypergraphs . By using the hyperg…
Colorings of -sets with low discrepancy on small sets
Pavel Pudlák, Vojtěch Rödl
For , let denote the smallest such that every coloring of -element subsets by two colors yields an -element set with relative discrepancy , w…
Some results and problems on clique coverings of hypergraphs
Vojtech Rödl, Marcelo Sales
For a -uniform hypergraph we consider the parameter , the minimum size of a clique cover of the of . We derive bounds on for belonging to various classes…
Independence number of hypergraphs under degree conditions
Vojtěch Rödl, Marcelo Sales, Yi Zhao
A well-known result of Ajtai et al. from 1982 states that every -graph on vertices, with girth at least five, and average degree contains an independent set of…