Triangles in K_s-saturated graphs with minimum degree t

From MaRDI portal
Publication:5113451

DOI10.20429/TAG.2020.070102zbMATH Open1441.05117arXiv1906.02154OpenAlexW3010229460MaRDI QIDQ5113451FDOQ5113451


Authors: Craig Timmons, Benjamin Cole, Albert Curry, David Davini Edit this on Wikidata


Publication date: 11 June 2020

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Abstract: For ngeq15, we prove that the minimum number of triangles in an n-vertex K4-saturated graph with minimum degree 4 is exactly 2n4, and that there is a unique extremal graph. This is a triangle version of a result of Alon, ErdH{o}s, Holzman, and Krivelevich from 1996. Additionally, we show that for any s>rgeq3 and tgeq2(s2)+1, there is a Ks-saturated n-vertex graph with minimum degree t that has copies of Kr. This shows that unlike the number of edges, the number of Kr's (r>2) in a Ks-saturated graph is not forced to grow with the minimum degree, except for possibly in lower order terms.


Full work available at URL: https://arxiv.org/abs/1906.02154




Recommendations





Cited In (5)





This page was built for publication: Triangles in \(K_s\)-saturated graphs with minimum degree \(t\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113451)