Preface to the first edition
Preface to the second edition
1. Graphs
2. Trees
3. Colorings of graphs and Ramsey’s theorem
4. Turán’s theorem and extremal graphs
5. Systems of distinct representatives
6. Dilworth’s theorem and extremal set theory
7. Flows in networks
8. De Bruijn sequences
9. Two (0,1,*) problems: addressing for graphs and a hash-coding scheme
10. The principle of inclusion and exclusion: inversion formulae
11. Permanents
12. The Van der Waerden conjecture
13. Elementary counting; Stirling numbers
14. Recursions and generating functions
15. Partitions
16. (0,1)-matrices
17. Latin squares
18. Hadamard matrices, Reed-Muller codes
19. Designs
20. Codes and designs
21. Strongly regular graphs and partial geometries
22. Orthogonal Latin squares
23. Projective and combinatorial geometries
24. Gaussian numbers and q-analogues
25. Lattices and Möbius inversion
26. Combinatorial designs and projective geometries
27. Difference sets and automorphisms
28. Difference sets and the group ring
29. Codes and symmetric designs
30. Association schemes
31. (More) algebraic techniques in graph theory
32. Graph connectivity
33. Planarity and coloring
34. Whitney duality
35. Embedding of graphs on surfaces
36. Electrical networks and squared squares
37. Pólya theory of counting
38. Baranyai’s theorem
Appendix 1. Hints and comments on problems
Appendix 2. Formal power series
Name index
Subject index