English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

For $n \geq 15$, we prove that the minimum number of triangles in an$n$-vertex $K_4$-saturated graph with minimum degree 4 is exactly $2n-4$, andthat there is a unique extremal graph. This is a triangle version of a resultof Alon, Erd\H{o}s, Holzman, and Krivelevich from 1996. Additionally, we showthat for any $s > r \geq 3$ and $t \geq 2 (s-2)+1$, there is a $K_s$-saturated$n$-vertex graph with minimum degree $t$ that has $\binom{ s-2}{r-1}2^{r-1} n +c_{s,r,t}$ copies of $K_r$. This shows that unlike the number of edges, thenumber of $K_r$'s ($r >2$) in a $K_s$-saturated graph is not forced to growwith the minimum degree, except for possibly in lower order terms.

Triangles in $K_s$-saturated graphs with minimum degree $t$