2009/06/03 by Michael Goff, Goff, Michael
Computer Science · Mathematics · #05D99 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Commutative Algebra and Its Applications #FOS: Mathematics #Topological and Geometric Data Analysis #math.CO #msc:05D99
paper · pdf · doi:10.48550/arxiv.0906.0763
arxiv created 2009/06/03 · openalex publication_date 2009/06/03 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.