A Course in Combinatorics / Edition 2

A Course in Combinatorics / Edition 2

ISBN-10:
0521006015
ISBN-13:
9780521006019
Pub. Date:
11/22/2001
Publisher:
Cambridge University Press
ISBN-10:
0521006015
ISBN-13:
9780521006019
Pub. Date:
11/22/2001
Publisher:
Cambridge University Press
A Course in Combinatorics / Edition 2

A Course in Combinatorics / Edition 2

$112.0
Current price is , Original price is $112.0. You
$112.00 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

$63.89 
  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.

    • Condition: Good
    Note: Access code and/or supplemental material are not guaranteed to be included with used textbook.

Overview

Combinatorics, a subject dealing with ways of arranging and distributing objects, 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 an essential tool in many scientific fields. In this second edition the authors have made the text as comprehensive as possible, dealing in a unified manner with such topics as 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. It is ideal for courses on combinatorical mathematics at the advanced undergraduate or beginning graduate level, and working mathematicians and scientists will also find it a valuable introduction and reference.

Product Details

ISBN-13: 9780521006019
Publisher: Cambridge University Press
Publication date: 11/22/2001
Edition description: Revised
Pages: 620
Product dimensions: 6.69(w) x 9.61(h) x 1.30(d)

Table of Contents

Preface; 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. 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 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. Algebraic graph theory: eigenvalue techniques; 32. Graphs: planarity and duality; 33. Graphs: colorings and embeddings; 34. Electrical networks and squared squares; 35. Pólya theory of counting; 36. Baranyai's theorem; Appendices; Name index; Subject index.
From the B&N Reads Blog

Customer Reviews