Matroids induced by graphs
- 305 Downloads
Consider a bipartite graph G with bipartition X 1 ∪ X 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 X ⊆ X 1, where N(X) denotes the set of neighbours of X.
Unable to display preview. Download preview PDF.