The ACO Seminar (2020–2021)

The combinatorial diameter of a simplicial complex is defined to be the diameter of its dual graph. For $n$ and $d$, one denotes by $H_s(n, d)$ the maximum possible combinatorial diameter of a pure $d$-dimensional, strongly connected simplicial complex on $n$ vertices. In this talk I discuss an application of the probabilistic method to give a new lower bound on $H_s(n, d)$ that is within an $O(d^2)$ factor of the trivial upper bound. This is joint work with Francisco Criado.

Please email Boris Bukh (bbukh ~at~ math) for a password.