AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution

Matching Theory

About this Title

László Lovász, Eötvös Loránd University, Budapest, Hungary and Michael D. Plummer, Vanderbilt University, Nashville, TN

Publication: AMS Chelsea Publishing
Publication Year: 2009; Volume 367
ISBNs: 978-0-8218-4759-6 (print); 978-1-4704-1575-4 (online)
DOI: https://doi.org/10.1090/chel/367

View full volume as PDF

Read more about this volume

Table of Contents

Download chapters as PDF

Front/Back Matter

• View this volume's front and back matter

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