Disjoint triangles and quadrilaterals in a graph (Q5900154): Difference between revisions

Let \(k\) and \(s\) be positive integers with \(s \leq k\), and let \(G\) be a graph of order \(n \geq 3s + 4(k - s) + 3\). The author shows that if \(\sigma_2(G) \geq n + s\), then \(G\) contains \(k\) disjoint cycles \(C_1, C_2, \cdots, C_k\) with \(| C_i| = 3\) for \(1 \leq i \leq s\) and \(| C_i| = 4\) for \(s < i \leq k\). This result parallels a theorem of \textit{S. Brandt}, \textit{G. Chen}, \textit{R. Faudree}, \textit{R. J. Gould}, and \textit{L. Lesniak} [J. Graph Theory 24, No. 2, 165--173 (1997; Zbl 0879.05060)] by giving a stronger conclusion (the cycles \(| C_i| = 4\) for \(i > s\) as opposed to just \(| C_i| \leq 4\) in the Brandt result) with the slightly stronger condition that \(n \geq 3s + 4(k - s) + 3\) as opposed to \(n \geq 3s +4(k - s)\).