MathNet 2004 — Part 01 Question 44

The edges of a graph with $2n$ vertices, $n \geq 4$, are colored in blue and red such that there is no blue triangle and there is no red complete subgraph with $n$ vertices. Find the least possible number of the blue edges.