Abstract
AbstractSuppose that in a complete graph on N points, each edge is given arbitrarily either the color red or the color blue, but the total number of blue edges is fixed at T. We find the minimum number of monochromatic triangles in the graph as a function of N and T. The maximum number of monochromatic triangles presents a more difficult problem. Here we propose a reasonable conjecture supported by examples.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Statistics and Probability
Reference4 articles.
1. On Chromatic Graphs
2. [3] Goodman A. W. , ‘Triangles in a complete chromatic graph with three colors’, Discrete Math. to appear.
3. On Sets of Acquaintances and Strangers at any Party
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph Entropy: Recent Results and Perspectives;Mathematical Foundations and Applications of Graph Entropy;2016-07-25
2. Frustrated triangles;Discrete Mathematics;2015-12
3. Extremality of degree-based graph entropies;Information Sciences;2014-09
4. Disjoint Color-Avoiding Triangles;SIAM Journal on Discrete Mathematics;2009-01
5. Maximizing the sum of the squares of the degrees of a graph;Discrete Mathematics;2004-08