Matching Covered Graphs and Subdivisions ofK4and[formula]

We give a very simple proof that every non-bipartite matching covered graph contains a nice subgraph that is an odd subdivision ofK4or[formula]. It follows immediately that every brick different fromK4and[formula]has an edge whose removal preserves the matching covered property. These are classical and very useful results due to Lovلsz.