On an extremal problem in graph theory. (Q775325)

The author considers graphs without loops or multiple edges. He proves that, if \(n \geq 400 k^2\), every graph with \(n\) vertices and at least \[ l=[{1 \over 4}(n-k+1)^2]+(k-1) (n-{1 \over 2} k+1) \] edges contains \(k\) disjoint triangles, with the exception of an (up to isomorphism) unique graph with \(n\) vertices and \(l\) edges. He states that a more complicated version of the proof can replace \(400 k^2\) by \(Ck\), where \(C\) is an absolute constant. The following further theorems are stated with brief hints for proof. Let \(G\) be a graph with \(n\) vertices. (1) If \(k \equiv n\) (mod 2) and every vertex has valency \(\geq {1 \over 2} (n+k)\) and \(n \geq \) some \(n_0(k)\), then \(G\) contains \(k\) disjoint triangles. (2) If \(n>ck\), where \(c\) is a sufficiently large absolute constant, and \(G\) has \({1 \over 4} n^2 +k\) edges, then \(G\) contains \(k\) triangles no two of which have a common edge.