Advertisement

Matroids induced by graphs

  • András Recski
Chapter
  • 305 Downloads
Part of the Algorithms and Combinatorics book series (AC, volume 6)

Abstract

Consider a bipartite graph G with bipartition X 1X 2. Recall Hall’s theorem: G has a matching which covers every point of X 1 if and only if |N(X)| ≥ |X| holds for every XX 1, where N(X) denotes the set of neighbours of X.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • András Recski
    • 1
  1. 1.Eötvös Loránd UniversityBudapest VIIIHungary

Personalised recommendations