Stefan Glock

collaborators

3 papers

math.CO2026

The maximum diameter of $d$ -dimensional simplicial complexes

Stefan Glock, Olaf Parczyk, Silas Rathke +1

For every fixed dimension $d$ and sufficiently large $n$ , we determine the maximum possible diameter of a strongly connected $d$ -dimensional simplicial complex on $n$ vertices. Thi…

math.CO2025

On the $(k + 2, k)$ -problem of Brown, ErdÅs and SÃ³s for $k = 5, 6, 7$

Stefan Glock, Jaehoon Kim, Lyuben Lichev +2

Let $f^{(r)} (n; s, k)$ denote the maximum number of edges in an $n$ -vertex $r$ -uniform hypergraph containing no subgraph with $k$ edges and at most $s$ vertices. Brown, ErdÅs and SÃ…

math.CO2025

Tight Hamilton cycles with high discrepancy

Lior Gishboliner, Stefan Glock, Amedeo Sgueglia

In this paper, we study discrepancy questions for spanning subgraphs of $k$ -uniform hypergraphs. Our main result is that, for any integers $k \geq 3$ and $r \geq 2$ , any $r$ -colourin…

The maximum diameter of d-dimensional simplicial complexes

On the (k+2,k)-problem of Brown, ErdÅs and SÃ³s for k=5,6,7

Tight Hamilton cycles with high discrepancy

The maximum diameter of $d$ -dimensional simplicial complexes

On the $(k + 2, k)$ -problem of Brown, ErdÅs and SÃ³s for $k = 5, 6, 7$