No label defined (Q3765800)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4023316
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4023316

      Statements

      0 references
      1985
      0 references
      two-colorings
      0 references
      complete graphs
      0 references
      minimal number of monochromatic triangles
      0 references
      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.
      0 references

      Identifiers