25 citations · 107 across the 24 of their papers we have counts for
31 papers
The maximum diameter of -dimensional simplicial complexes
Stefan Glock, Olaf Parczyk, Silas Rathke +1
For every fixed dimension and sufficiently large , we determine the maximum possible diameter of a strongly connected -dimensional simplicial complex on vertices. Thi…
On the -problem of Brown, Erdős and Sós for
Stefan Glock, Jaehoon Kim, Lyuben Lichev +2
Let denote the maximum number of edges in an -vertex -uniform hypergraph containing no subgraph with edges and at most vertices. Brown, Erdős and Sós…
Tight Hamilton cycles with high discrepancy
Lior Gishboliner, Stefan Glock, Amedeo Sgueglia
In this paper, we study discrepancy questions for spanning subgraphs of -uniform hypergraphs. Our main result is that, for any integers and , any -colourin…
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 , the binomial random graph is with high probability Hamiltonian. This leads to the following natural…
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 -regular …
On the -problem of Brown, Erdős and Sós
Stefan Glock, Felix Joos, Jaehoon Kim +3
Let be the maximum number of edges of an -uniform hypergraph on vertices not containing a subgraph with edges and at most vertices. In 1973, Brown,…