English

Minimum degree in simplicial complexes

Combinatorics 2025-01-03 v1

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<Sα(d)V(S)0<\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 α(2dm)=2d+1md+1\alpha(2^d-m)=\frac{2^{d+1}-m}{d+1}. Similar results were obtained independently by Li, Ma, and Rong.

Keywords

Cite

@article{arxiv.2501.01294,
  title  = {Minimum degree in simplicial complexes},
  author = {Christian Reiher and Bjarne Schülke},
  journal= {arXiv preprint arXiv:2501.01294},
  year   = {2025}
}
R2 v1 2026-06-28T20:54:39.694Z