Multiplicity of triangles in \(2\)-edge coloring of a family of graphs. (Q2715992)
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 1600961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiplicity of triangles in \(2\)-edge coloring of a family of graphs. |
scientific article; zbMATH DE number 1600961 |
Statements
20 July 2005
0 references
\(2\)-edge coloring
0 references
minimal coloring
0 references
Multiplicity of triangles in \(2\)-edge coloring of a family of graphs. (English)
0 references
In the paper is obtained a lower bound for the multiplicity of triangles in any \(2\)-edge coloring of the family of graphs obtained from a complete graph by removing a set of parallel edges.
0 references
0.8955378532409668
0 references
0.8680082559585571
0 references
0.8476109504699707
0 references
0.7917678356170654
0 references
