Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
A Course in Combinatorics

A Course in Combinatorics

2nd Edition

£55.99

textbook
  • Date Published: November 2001
  • availability: Available
  • format: Paperback
  • isbn: 9780521006019

£ 55.99
Paperback

Add to cart Add to wishlist

Other available formats:
eBook


Request inspection copy

Lecturers may request a copy of this title for inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Uniquely comprehensive coverage
    • Authors are leading experts
    • Very pedagogic - carefully explained
    Read more

    Reviews & endorsements

    'Both for the professional with a passing interest in combinatorics and for the students for whom it is primarily intended, this is a valuable book.' The Times Higher Education Supplement

    '… it will no doubt become a standard choice among the many texts on combinatorics … fascinating … it is highly recommended reading.' Dieter Jungnichel, Zentralblatt MATH

    'This well written textbook can be highly recommended to any student of combinatorics and, because of its breadth, has many new things to tell researchers in the field also.' EMS

    'This is a fascinating introduction to almost all aspects of combinatorics. Plenty of interesting problems, concrete examples, useful notes and references complement the main text. This book can be highly recommended to everyone interested in combinatorics.' Monatshefe für Mathematik

    '… becoming a modern classic … every good student should progress to this book at some stage: it is a wonderful source of elegant proofs and tantalising examples. No-one will find it easy, but every budding or established combinatorialist will be enriched by it … This text is unashamedly and impressively mathematical; it will challenge and inform every reader and is a very significant achievement.' The Mathematical Gazette

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Edition: 2nd Edition
    • Date Published: November 2001
    • format: Paperback
    • isbn: 9780521006019
    • length: 620 pages
    • dimensions: 244 x 170 x 33 mm
    • weight: 1.02kg
    • contains: 66 b/w illus.
    • availability: Available
  • 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.

  • Authors

    J. H. van Lint, Technische Universiteit Eindhoven, The Netherlands

    R. M. Wilson, California Institute of Technology

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×