Jan Volec

activity

20232025

most citedA tight lower bound on the minimal dispersion

3 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

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 $δ^{+} (G) = d$ contains a subgraph $H$ satisfying \[ \min\left\{δ^+(H), δ^-(H) \right\} \ge \frac{d(d+1)}…

math.CO2024

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…