scientific article; zbMATH DE number 4023316

From MaRDI portal
Publication:3765800





The paper deals with the two-colorings of complete graphs \(K_ n\) with \(g(K_ n)\) monochromatic triangles, where \(g(K_ n)\) is the minimal number of monochromatic triangles in the set of all possible two- colorings of the edges of the complete graph with n vertices. We prove that \(\lim_{n\to \infty}(\delta (n))/n^ 2=1/8\), where \(\delta\) (n) denotes the minimum of monochromatic triangles with common Sertex in the set of all two-colorings of \(K_ n\) with \(g(K_ n)\) monochromatic triangles.











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 Q3765800)