A review of recent advances in arrow relations and traces of sets, presenting known theorems, constructions, and open problems without new results.
Minimum degree in simplicial complexes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Given $d\in\mathbb{N}$, let $\alpha(d)$ be the largest real number such that every abstract simplicial complex $\mathcal{S}$ with $0<\vert\mathcal{S}\vert\leq\alpha(d)\vert V(\mathcal{S})\vert$ has a vertex of degree at most $d$. We extend previous results by Frankl, Frankl and Watanabe, and Piga and Sch\"ulke by proving that for all integers $d$ and $m$ with $d\geq m\geq 1$, we have $\alpha(2^d-m)=\frac{2^{d+1}-m}{d+1}$. Similar results were obtained independently by Li, Ma, and Rong.
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Recent advances in arrow relations and traces of sets
A review of recent advances in arrow relations and traces of sets, presenting known theorems, constructions, and open problems without new results.