Book contents
- Frontmatter
- Contents
- Preface
- Notation
- Chapter 1 Basic concepts
- Chapter 2 Introduction to bipartite graphs
- Chapter 3 Metric properties
- Chapter 4 Connectivity
- Chapter 5 Maximum matchings
- Chapter 6 Expanding properties
- Chapter 7 Subgraphs with restricted degrees
- Chapter 8 Edge colourings
- Chapter 9 Doubly stochastic matrices and bipartite graphs
- Chapter 10 Coverings
- Chapter 11 Some combinatorial applications
- Chapter 12 Bipartite subgraphs of arbitrary graphs
- Appendix
- References
- Index
Chapter 5 - Maximum matchings
Published online by Cambridge University Press: 05 November 2011
- Frontmatter
- Contents
- Preface
- Notation
- Chapter 1 Basic concepts
- Chapter 2 Introduction to bipartite graphs
- Chapter 3 Metric properties
- Chapter 4 Connectivity
- Chapter 5 Maximum matchings
- Chapter 6 Expanding properties
- Chapter 7 Subgraphs with restricted degrees
- Chapter 8 Edge colourings
- Chapter 9 Doubly stochastic matrices and bipartite graphs
- Chapter 10 Coverings
- Chapter 11 Some combinatorial applications
- Chapter 12 Bipartite subgraphs of arbitrary graphs
- Appendix
- References
- Index
Summary
Properties of maximum matchings
A set of edges in a graph G is called a matching if no two edges have a common end vertex. A matching with the largest possible number of edges is called a maximum matching.
Many discrete problems can be formulated as problems about maximum matchings. Consider, for example, probably the most famous:
A set of boys each know several girls, is it possible for the boys each to marry a girl that he knows?
This situation has a natural representation as the bipartite graph with bipartition (V1, V2), where V1 is the set of boys, V2 the set of girls and an edge between a boy and a girl represents that they know one another. The marriage problem is then the problem: does a maximum matching of G have |V1| edges?
Let M be a matching of a graph G. A vertex v is said to be covered, or saturated by M, if some edge of M is incident with v. We shall also call an unsaturated vertex free. A path or cycle is alternating, relative to M, if its edges are alternately in E(G)\M and M. A path is an augmenting path if it is an alternating path with free origin and terminus. Throughout this, and the following section, we shall identify a path P or a cycle C with the set of edges it embodies, and write |P| and |C| for the cardinalities of these sets of edges.
- Type
- Chapter
- Information
- Bipartite Graphs and their Applications , pp. 56 - 74Publisher: Cambridge University PressPrint publication year: 1998