Silas Rathke
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Silas Rathke has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Tibor Szabó
Fachbereich Mathematik und Informatik Freie Universität Berlin Arnimallee 3 14195 Berlin Germany
2 shared publications - Ander Lamaison
Supported by Hubei Provincial Natural Science Foundation of China (No Extremal Combinatorics and Probability Group (ECOPRO) Institute for Basic Science (IBS) 2025AFB666 Daejeon South Korea
1 shared publication - Jack Allsop1 shared publication
Olaf Parczyk
1 shared publication- Olaf Parczyk
Department of Mathematics and Computer Science, Freie Universität Berlin, Arnimallee 3, 14195 Berlin, Germany
1 shared publication - Olaf Parczyk
Fachbereich Mathematik und Informatik Freie Universität Berlin Arnimallee 3 14195 Berlin Germany
1 shared publication
Latest Publications
- Open Access
- 27 April 2026
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 76 (3) , 1687-1724
The Maximum Diameter of 2-Dimensional Simplicial Complexes
We study a problem of Santos about the largest possible diameter of a d -dimensional (abstract) simplicial complex on n vertices. For dimension 2, we determine the exact value of the maximum for every n using an explicit construction. We also come across a tantalizing open problem about the packing of squares of Hamilton cycles in the complete graph and obtain an infinite sequence of tight explicit constructions.
- 27 April 2026
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 76 (3) , 1687-1724
Open AccessThe Maximum Diameter of 2-Dimensional Simplicial Complexes
We study a problem of Santos about the largest possible diameter of a d -dimensional (abstract) simplicial complex on n vertices. For dimension 2, we determine the exact value of the maximum for every n using an explicit construction. We also come across a tantalizing open problem about the packing of squares of Hamilton cycles in the complete graph and obtain an infinite sequence of tight explicit constructions.
- Open Access
The maximum diameter of $d$-dimensional simplicial complexes
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. This improves on a sequence of previous results and settles a problem of Santos from 2013. On the way, as a special case, we also characterise the existence of an extra-tight Euler tour in the complete $d$-uniform hypergraph on $n$ vertices.Open AccessThe maximum diameter of $d$-dimensional simplicial complexes
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. This improves on a sequence of previous results and settles a problem of Santos from 2013. On the way, as a special case, we also characterise the existence of an extra-tight Euler tour in the complete $d$-uniform hypergraph on $n$ vertices. - Open Access
Spanning Components and Surfaces Under Minimum Vertex Degree
We study minimum vertex-degree conditions in 3-uniform hypergraphs for (tight) spanning components and (combinatorial) surfaces. Our main results show that a 3-uniform hypergraph $G$ on $n$ vertices contains a spanning component if $δ_1(G) \gtrsim \tfrac{1}{2} \binom{n}{2}$ and a spanning copy of any surface if $δ_1(G) \gtrsim \tfrac{5}{9} \binom{n}{2}$, which in both cases is asymptotically optimal. This extends the work of Georgakopoulos, Haslegrave, Montgomery, and Narayanan who determined the corresponding minimum codegree conditions in this setting.Open AccessSpanning Components and Surfaces Under Minimum Vertex Degree
We study minimum vertex-degree conditions in 3-uniform hypergraphs for (tight) spanning components and (combinatorial) surfaces. Our main results show that a 3-uniform hypergraph $G$ on $n$ vertices contains a spanning component if $δ_1(G) \gtrsim \tfrac{1}{2} \binom{n}{2}$ and a spanning copy of any surface if $δ_1(G) \gtrsim \tfrac{5}{9} \binom{n}{2}$, which in both cases is asymptotically optimal. This extends the work of Georgakopoulos, Haslegrave, Montgomery, and Narayanan who determined the corresponding minimum codegree conditions in this setting. - Open Access
The maximum diameter of 2-dimensional simplicial complexes
We study a problem of Santos about the largest possible diameter of a $d$-dimensional (abstract) simplicial complex on $n$ vertices. For dimension 2, we determine the exact value of the maximum for every $n$ using an explicit construction. We also come across a tantalizing open problem about the packing of squares of Hamilton cycles in the complete graph and obtain an infinite sequence of tight explicit constructions.Open AccessThe maximum diameter of 2-dimensional simplicial complexes
We study a problem of Santos about the largest possible diameter of a $d$-dimensional (abstract) simplicial complex on $n$ vertices. For dimension 2, we determine the exact value of the maximum for every $n$ using an explicit construction. We also come across a tantalizing open problem about the packing of squares of Hamilton cycles in the complete graph and obtain an infinite sequence of tight explicit constructions.