Problem #PRU-5250

Problems Graph Theory

Problem

Show that a bipartite graph with \(n\) vertices cannot have more than \(\frac{n^2}{4}\) edges.