3 citations · 3 across the 4 of their papers we have counts for
4 papers
Lower bounds on the minimal dispersion of point sets via cover-free families
Matěj Trödler, Jan Volec, Jan Vybíral
We elaborate on the intimate connection between the largest volume of an empty axis-parallel box in a set of points from and cover-free families from the extremal set…
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)}…
Tight Hamiltonicity from dense links of triples
Richard Lang, Mathias Schacht, Jan Volec
We show that for all , , and sufficiently large, every -uniform hypergraph on vertices in which each set of vertices is contained in at le…
A tight lower bound on the minimal dispersion
Matěj Trödler, Jan Volec, Jan Vybíral
We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very…