An error was encountered while trying to add the item to the cart. Please try again.
Copy To Clipboard
Successfully Copied!
Matching Theory

László Lovász Eötvös Loránd University, Budapest, Hungary
Michael D. Plummer Vanderbilt University, Nashville, TN
AMS Chelsea Publishing: An Imprint of the American Mathematical Society
Available Formats:
Hardcover ISBN: 978-0-8218-4759-6
Product Code: CHEL/367.H
List Price: $79.00 MAA Member Price:$71.10
AMS Member Price: $71.10 Electronic ISBN: 978-1-4704-1575-4 Product Code: CHEL/367.H.E List Price:$79.00
MAA Member Price: $71.10 AMS Member Price:$63.20
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $118.50 MAA Member Price:$106.65
AMS Member Price: $106.65 Click above image for expanded view Matching Theory László Lovász Eötvös Loránd University, Budapest, Hungary Michael D. Plummer Vanderbilt University, Nashville, TN AMS Chelsea Publishing: An Imprint of the American Mathematical Society Available Formats:  Hardcover ISBN: 978-0-8218-4759-6 Product Code: CHEL/367.H  List Price:$79.00 MAA Member Price: $71.10 AMS Member Price:$71.10
 Electronic ISBN: 978-1-4704-1575-4 Product Code: CHEL/367.H.E
 List Price: $79.00 MAA Member Price:$71.10 AMS Member Price: $63.20 Bundle Print and Electronic Formats and Save! This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.  List Price:$118.50 MAA Member Price: $106.65 AMS Member Price:$106.65
• Book Details

AMS Chelsea Publishing
Volume: 3672009; 547 pp
MSC: Primary 05; 90;

This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. Besides basic results on the existence of matchings and on the matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics. The new Appendix outlines how the theory and applications of matching theory have continued to develop since the book was first published in 1986, by launching (among other things) the Markov Chain Monte Carlo method.

Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms.

• Chapters
• Chapter 1. Matchings in bipartite graphs
• Chapter 2. Flow theory
• Chapter 3. Size and structure of maximum matchings
• Chapter 4. Bipartite graphs with perfect matchings
• Chapter 5. General graphs with perfect matchings
• Chapter 6. Some graph-theoretical problems related to matchings
• Chapter 7. Matching and linear programming
• Chapter 8. Determinants and matchings
• Chapter 9. Matching algorithms
• Chapter 10. The $f$-factor problem
• Chapter 11. Matroid matching
• Chapter 12. Vertex packing and covering
• Appendix: Developments in matching theory since this book was first published

• Requests

Review Copy – for reviewers who would like to review an AMS book
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Volume: 3672009; 547 pp
MSC: Primary 05; 90;

This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. Besides basic results on the existence of matchings and on the matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics. The new Appendix outlines how the theory and applications of matching theory have continued to develop since the book was first published in 1986, by launching (among other things) the Markov Chain Monte Carlo method.

Graduate students and research mathematicians interested in graph theory, combinatorics, combinatorial optimization, or graph algorithms.

• Chapters
• Chapter 1. Matchings in bipartite graphs
• Chapter 2. Flow theory
• Chapter 3. Size and structure of maximum matchings
• Chapter 4. Bipartite graphs with perfect matchings
• Chapter 5. General graphs with perfect matchings
• Chapter 6. Some graph-theoretical problems related to matchings
• Chapter 7. Matching and linear programming
• Chapter 8. Determinants and matchings
• Chapter 9. Matching algorithms
• Chapter 10. The $f$-factor problem
• Chapter 11. Matroid matching
• Chapter 12. Vertex packing and covering
• Appendix: Developments in matching theory since this book was first published
Review Copy – for reviewers who would like to review an AMS book
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
You may be interested in...
Please select which format for which you are requesting permissions.