A conjecture of \(3\)-colored triangles in the complete graph
Home
Search
Subjects
About Erdös
About This Site
Search
Subjects
- All (170)
- Ramsey Theory (40)
- Extremal Graph Theory (40)
- Coloring, Packing, and Covering (25)
- Random Graphs and Graph Enumeration (16)
- Hypergraphs (35)
- Infinite Graphs (14)
About Erdös
About This Site
Conjecture (proposed by Erdös and Sós [1])
Suppose the edges of \(K_n\) are \(3\)-colored so that the number of \(3\)-colored triangles is maximized, say, having \(F(n)\) such triangles. Then \[ F(n)=F(a)+F(b)+F(c) +F(d) + (a^{-1}+b^{-1}+c^{-1}+d^{-1})abcd \] where \(a+b+c+d=n\) and \(a,b,c,d\) are as equal as possible.
Bibliography | |
---|---|
1 | J. Nešetril and V. Rödl, eds., Mathematics of Ramsey Theory, Springer-Verlag, Berlin, 1990. |