Free Download Perfect Matchings: A Theory of Matching Covered Graphs
English | 2024 | ISBN: 3031475038 | 584 Pages | PDF (True) | 8 MB
A graph is matchable if it has a perfect matching. A matching covered graph is a connected graph on at least two vertices in which each edge is covered by some perfect matching. The theory of matching covered graphs, though of relatively recent vintage, has an array of interesting results with elegant proofs, several surprising applications and challenging unsolved problems.