2000 character limit reached
Minimum degree in simplicial complexes
Published 2 Jan 2025 in math.CO | (2501.01294v1)
Abstract: Given , let be the largest real number such that every abstract simplicial complex with $0<\vert\mathcal{S}\vert\leq\alpha(d)\vert V(\mathcal{S})\vert$ has a vertex of degree at most . We extend previous results by Frankl, Frankl and Watanabe, and Piga and Sch\"ulke by proving that for all integers and with , we have . Similar results were obtained independently by Li, Ma, and Rong.
Paper Prompts
Sign up for free to create and run prompts on this paper.