Minimum degree in simplicial complexes
Combinatorics
2025-01-03 v1
Abstract
Given , let be the largest real number such that every abstract simplicial complex with 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.
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}
}