Perfect Matchings Versus Odd Cuts

We give a simple proof for an important result of Edmonds, Lovász and Pulleyblank, stating that a brick has no non-trivial tight cuts. Our proof relies on some results on almost critical graphs. The introduction of these graphs is the second aim of the present paper.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Zoltán Szigeti.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Szigeti, Z. Perfect Matchings Versus Odd Cuts. Combinatorica 22, 575–589 (2002). https://doi.org/10.1007/s00493-002-0008-6

Download citation

AMS Subject Classification (2000):

  • 05C70