product iamge

Matching Theory

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

The subject has obviously advanced a lot since the book was published, but the overview provided is still unmatched. The book has concise and clear expositions of things I did not expect to see there (for example, Kasteleyn's enumeration theory for planar graphs), and which are hard to find anywhere else. Should be right next to Combinatorial Problems and Exercises (AMS Chelsea Publishing) on your bookshelf.

Author(s): L. Lovász and M.D. Plummer (Eds.)
Series: North-Holland Mathematics Studies 121 / Annals of Discrete Mathematics 29
Edition: 1st
Publisher: Elsevier Science Ltd
Year: 1986

Language: English
Pages: C1, D1, vii-xxxiii

Content:
Edited by
Page C1

Copyright page
Page D1

Preface
Pages vii-xxvii

Basic Terminology
Pages xxix-xxxiii

1 Matchings in Bipartite Graphs
Pages 1-40

2 Flow Theory
Pages 41-81

3 Size and Structure of Maximum Matchings
Pages 83-119

4 Bipartite Graphs with Perfect Matchings
Pages 121-141

5 General Graphs with Perfect Matchings
Pages 143-211

6 Some Graph-theoretical Problems Related to Matchings
Pages 213-254

7 Matching and Linear Programming
Pages 255-305

8 Determinants and Matchings
Pages 307-355

9 Matching Algorithms
Pages 357-382

10 The f-factor Problem
Pages 383-408

11 Matroid Matching
Pages 409-441

12 Vertex Packing and Covering
Pages 443-482

References Review Article
Pages 483-526

Index of Terms
Pages 527-537

Index of Symbols
Pages 539-544