Higher dimensional Moore bounds

DOI10.1007/S00373-010-0979-9zbMATH Open1233.05223arXiv0906.0763OpenAlexW2135931391MaRDI QIDQ659717FDOQ659717

Michael Goff

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/0906.0763

zbMATH Keywords

Moore boundSimplicial complexGirthFace numbersMultiplicity conjecture

Mathematics Subject Classification ID

Distance in graphs (05C12) Combinatorial aspects of simplicial complexes (05E45) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites Work

• Title not available (Why is that?)
• Topological persistence and simplification
• Combinatorics and commutative algebra.
• Ramanujan graphs
• Explicit constructions of Ramanujan complexes of type \(\widetilde A_d\).
• The Moore bound for irregular graphs
• Bounds for multiplicities
• Betti numbers of graded modules and cohomology of vector bundles
• Betti numbers of graded modules and the multiplicity conjecture in the non-Cohen-Macaulay case
• A Moore bound for simplicial complexes
• Face vectors of flag complexes
• Face Ring Multiplicity via CM-Connectivity Sequences
• Edges in graphs with large girth

Cited In (3)

• Simplicial girth and pure resolutions
• How many simplices are needed to triangulate a Grassmannian?
• On regular hypergraphs of high girth

Uses Software

• BoijSoederberg

This page was built for publication: Higher dimensional Moore bounds

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