Problem

Source:

Tags: combinatorics proposed, combinatorics



Let $G$ be a simple graph with $100$ edges on $20$ vertices. Suppose that we can choose a pair of disjoint edges in $4050$ ways. Prove that $G$ is regular.