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.

Скачать книгу бесплатно (djvu, 7.10 Mb)

---

Читать «Matching Theory»