The Moore Bound for Regular Simplicial Complexes
Sukrit Chakraborty
TL;DR
This paper establishes upper bounds similar to Moore bounds for regular simplicial complexes and provides logarithmic lower bounds on their diameter based on minimum degree, advancing understanding of their combinatorial properties.
Contribution
It introduces Moore-type upper bounds and logarithmic diameter bounds for regular simplicial complexes, a novel extension of classical graph theory results.
Findings
Derived Moore-type upper bounds for regular simplicial complexes.
Established logarithmic lower bounds on diameter based on minimum degree.
Extended classical bounds from graph theory to higher-dimensional complexes.
Abstract
We derive Moore-type upper bounds for regular simplicial complexes and present logarithmic lower bounds on their diameter based on minimum degree.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.