Jan Volec

collaborators

3 papers

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

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 $n$ points from $[0, 1]^{d}$ and cover-free families from the extremal set…

math.CO2025

Tight Hamiltonicity from dense links of triples

Richard Lang, Mathias Schacht, Jan Volec

We show that for all $k \geq 4$ , $ε > 0$ , and $n$ sufficiently large, every $k$ -uniform hypergraph on $n$ vertices in which each set of $k - 3$ vertices is contained in at le…