Complexes of nearly maximum diameter

MaRDI QIDQ6397438zbMATH OpenFDO

Authors Tom Bohman, Andrew Newman

Publication date 25 April 2022

Abstract: The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $(frac1dcdotd!-(logn{)}^{-epsilon})n^d$. Up to the first order term, this is the best possible lower bound for the maximum diameter of a $d$-complex on $n$ vertices as a simple volume argument shows that the diameter of a $d$-dimensional simplicial complex is at most $$. We also find the right first-order asymptotics for the maximum diameter of a $d$-pseudomanifold on $n$ vertices.

This page was built for publication: Complexes of nearly maximum diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397438)