no. 13 · Wednesday 11 November 2026
Positive Codegree Density of Suspensions of Graphs
Abstract
We determine the exact positive codegree density of suspensions of graphs $S^r(G)$ when $χ(G)=t$ and $t-2$ is prime power. The value is $γ^+(S^{r}(G)) = \frac{(t-3)(t-2)^{r-1}}{(t-2)^r-1}$. The case of suspensions of $K_4$ gives the positive codegree density of daisies, answering a question of Balogh, Halfpap, Lidický and Palmer. The lower bound construction is from Ellis, Ivan and Leader, while we establish the corresponding upper bound based on a weighted graph inequality.
- comments
- 12 pages. Comments are welcome
- fields
- Combinatorics