scientific article; zbMATH DE number 3882465

From MaRDI portal
Publication:3216682





[For the entire collection see Zbl 0543.00003.] The Turán numbers (the Turán number T(n,G) is the maximal number of edges in a graph with n vertices which contains no copy of G) \(T(10,C_ 4)=15\) and \(T(11,C_ 4)=18\) are calculated, and the only two graphs with 10 vertices, 15 edges and no copy of a \(C_ 4\) are determined. It follows immediately from \(T(11,C_ 4)=18\) that the Ramsey number \(r(C_ 4,C_ 4,C_ 4)\geq 11\). A \(C_ 4\)-free 3-coloring of \(K_{10}\), using the two Turán graphs on 10 vertices is given, which verifies that \(r(C_ 4,C_ 4,C_ 4)=11\).











This page was built for publication:

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