Machine derived contents note: 1. The binomial coefficients -- 2. How many trees? -- 3. The marriage theorem -- 4. Three basic principles -- 5. Latin squares -- 6. The first theorem of graph theory -- 7. Edge-colourings -- 8. Harems and tournaments -- 9. Minimax theorems -- 10. Recurrence -- 11. Vertex-colourings -- 12. Rook polynomials -- 13. Planar graphs -- 14. Map-colourings -- 15. Designs and codes -- 16. Ramsey theory -- Hints to exercises -- Answers to exercises -- Bibliography -- Index
Bibliography
Includes bibliographical references (page [262]) and index
