Combinatorics and Graph Theory · Problem 1.6.7

Fundamentals — David Guichard

Mathematics — Combinatorics · ramsey-theory

Problem

Show that if the edges of K6K_6 are colored with two colors, there are at least two monochromatic triangles. (Two triangles are different if each contains at least one vertex not in the other. For example, two red triangles that share an edge count as two triangles.) Color the edges of K6K_6 so that there are exactly two monochromatic triangles.

Related theory

Browse the problem library