Perfect matchings in regular bipartite graphs (Q2563421)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings in regular bipartite graphs |
scientific article |
Statements
Perfect matchings in regular bipartite graphs (English)
0 references
12 December 1996
0 references
It is known that \(k\)-regular bipartite graphs can be decomposed into \(k\) edge-disjoint perfect matchings. The authors give sufficient conditions so that by deleting a set \(S\) of \(k+r\) edges, \(G-S\) still has a perfect matching. The result is, in some sense, best possible.
0 references
regular graph
0 references
bipartite graphs
0 references
perfect matchings
0 references
