Prove that the graph G is regular
Source:
October 31, 2010
combinatorics proposedcombinatorics
Problem Statement
Let be a simple graph with edges on vertices. Suppose that we can choose a pair of disjoint edges in ways. Prove that is regular.
Source: