Density of Gallai multigraphs (Q2256125)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Density of Gallai multigraphs |
scientific article |
Statements
Density of Gallai multigraphs (English)
0 references
19 February 2015
0 references
Summary: \textit{A. Diwan} and \textit{D. Mubayi} asked how many edges of each color could be included in a 3-edge-colored multigraph containing no rainbow triangle [``TurĂ¡n's theorem with colors'', Preprint (2006), \url{http: //www.math.cmu.edu/~mubayi/papers/webturan.pdf}]. We answer this question under the modest assumption that the multigraphs in question contain at least one edge between every pair of vertices. We also conjecture that this assumption is, in fact, without loss of generality.
0 references
rainbow triangle
0 references
Gallai coloring
0 references
multigraph
0 references