Stefan Glock

activity

20142026

most citedOptimal path and cycle decompositions of dense quasirandom graphs

25 citations · 107 across the 24 of their papers we have counts for

collaborators

Showing 2023 · math.COShow all

3 papers · 2 filters

math.CO2023★ 3 cited

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…

math.CO2023

Optimal Hamilton covers and linear arboricity for random graphs

Nemanja Draganić, Stefan Glock, David Munhá Correia +1

In his seminal 1976 paper, Pósa showed that for all $p \geq C lo g n / n$ , the binomial random graph $G (n, p)$ is with high probability Hamiltonian. This leads to the following natural…

math.CO2023

Hamilton cycles in pseudorandom graphs

Stefan Glock, David Munhá Correia, Benny Sudakov

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$ -regular $n$ …