The Two Ear Theorem on Matching-Covered Graphs

We give a simple and short proof for the two ear theorem on matching-covered graphs which is a well-known result of Lovلsz and Plummer. The proof relies only on the classical results of Tutte and Hall on perfect matchings in (bipartite) graphs.