Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minimum degree in simplicial complexes

Published 2 Jan 2025 in math.CO | (2501.01294v1)

Abstract: Given dNd\in\mathbb{N}, let α(d)\alpha(d) be the largest real number such that every abstract simplicial complex S\mathcal{S} with $0&lt;\vert\mathcal{S}\vert\leq\alpha(d)\vert V(\mathcal{S})\vert$ has a vertex of degree at most dd. We extend previous results by Frankl, Frankl and Watanabe, and Piga and Sch\"ulke by proving that for all integers dd and mm with dm1d\geq m\geq 1, we have α(2<sup>dm)=2<sup>d+1md+1\alpha(2<sup>d-m)=\frac{2<sup>{d+1}-m}{d+1}. Similar results were obtained independently by Li, Ma, and Rong.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.