A course in combinatorics
Author(s)
Bibliographic Information
A course in combinatorics
Cambridge University Press, c1992
- : hbk
- : pbk
Available at 53 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references and indexes
Description and Table of Contents
Description
This major textbook, a product of many years' teaching, will appeal to all teachers of combinatorics who appreciate the breadth and depth of the subject. The authors exploit the fact that combinatorics requires comparatively little technical background to provide not only a standard introduction but also a view of some contemporary problems. All of the 36 chapters are in bite-size portions; they cover a given topic in reasonable depth and are supplemented by exercises, some with solutions, and references. To avoid an ad hoc appearance, the authors have concentrated on the central themes of designs, graphs and codes.
Table of Contents
- 1. Graphs
- 2. Trees
- 3. Colourings of graphs and Ramsey's theorem
- 4. Turan's theorem
- 5. Systems of distinct representatives
- 6. Dilworth's theorem and extremal set theory
- 7. Flows in networks
- 8. De Bruijn sequences
- 9. The addressing problem for graphs
- 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 generated 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 Moebius inversion
- 26. Combinatorial designs and projective geometry
- 27. Difference sets and automorphisms
- 28. Difference sets and the group ring
- 29. Codes and symmetric designs
- 30. Association schemes
- 31. Algebraic graphs: eigenvalue techniques
- 32. Graphs: planarity and duality
- 33. Graphs: colourings and embeddings
- 34. Trees, electrical networks and squared rectangles
- 35. Polya theory of counting
- 36. Baranyai's theorem
- Appendices.
by "Nielsen BookData"