MathDB

G is a complete geometric graph such that for any 4-coloring of its edges, we can find n edges which are pairwise disjoint and have the same color. Prove that the minimum number of vertices of G is 6n-4. a graph with 6n-4 vertices has 2n-1 pairwise disjoint edges with 1 of 2 colors. by PP, there exist n pairwise disjoint edges of the same color.

Problem Statement