On a theorem of Rademacher-Turán (Q773996)

Non-directed finite graphs without loops and parallel edges are considered. The main result is: there exists a positive constant \(c_1\) such that, if \(t< {1 \over 2} c_1n\), any graph having \(n\) vertices and \(\left [ {1 \over 4} n^2 \right ]+t\) edges contains at least \(t\left [ {1 \over 2} n \right ]\) triangles. One of the lemma states: if a graph has \(n\) vertices and \(\left [ {1 \over 4} (n-1)^2 \right ] +2\) edges, then either it is even or it contains a triangle. --- [Reviewer's note: --- 3 must be added to the left-hand side of the formula (1) on p. 124. This correction does not touch the validity of the further estimations.]