Graph theory
Source: Bulgarian IMO TST 2004, Day 3, Problem 2
July 8, 2013
combinatorics proposedcombinatoricsRamsey Theorygraph theory
Problem Statement
The edges of a graph with vertices () are colored in blue and red such that there is no blue triangle and there is no red complete subgraph with vertices. Find the least possible number of blue edges.