A course in combinatorics
Author(s)
Bibliographic Information
A course in combinatorics
Cambridge University Press, 2001
2nd ed
- : hard
- : pbk
Available at / 48 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
VAN||17||5(2)01063778
-
Hiroshima University Central Library, Interlibrary Loan
411.22:L-654000411819,
: pbk411.22:L-652030413750 -
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science数学
: hard/L 6562080506195
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and indexes
Description and Table of Contents
Description
This is the second edition of a popular book on combinatorics, a subject dealing with ways of arranging and distributing objects, and which involves ideas from geometry, algebra and analysis. The breadth of the theory is matched by that of its applications, which include topics as diverse as codes, circuit design and algorithm complexity. It has thus become essential for workers in many scientific fields to have some familiarity with the subject. The authors have tried to be as comprehensive as possible, dealing in a unified manner with, for example, graph theory, extremal problems, designs, colorings and codes. The depth and breadth of the coverage make the book a unique guide to the whole of the subject. The book is ideal for courses on combinatorical mathematics at the advanced undergraduate or beginning graduate level. Working mathematicians and scientists will also find it a valuable introduction and reference.
Table of Contents
- Preface
- 1. Graphs
- 2. Trees
- 3. Colorings of graphs and Ramsey's theorem
- 4. Turan'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. 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 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 Moebius 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. Algebraic graph theory: eigenvalue techniques
- 32. Graphs: planarity and duality
- 33. Graphs: colorings and embeddings
- 34. Electrical networks and squared squares
- 35. Polya theory of counting
- 36. Baranyai's theorem
- Appendices
- Name index
- Subject index.
by "Nielsen BookData"