MathDB

A graph is called

7-chip

if it obtained by removing at most three edges that have no vertex in common from a complete graph with seven vertices. Consider a complete graph

G

with

v

vertices which each edge of its is colored blue or red. Prove that there is either a blue path with

100

edges or a red

7-chip

Problem Statement