Post #2158802

If I colour all the edges of a complete graph with n vertices red, then in a way, I "forced" this "Ramsey-situation": \(K(N, p; 2)\)