A Short Proof of the Factor Theorem for Finite Graphs

Abstract

We define a graph as a set V of objects called vertices together with a set E of objects called edges , the two sets having no common element. With each edge there are associated just two vertices, called its ends. We say that an edge joins its ends. Two vertices may be joined by more than one edge.