Buy Used
Used - Acceptable See details
$16.72 & eligible for FREE Super Saver Shipping on orders over $25. Details

or
Sign in to turn on 1-Click ordering.
 
   
Have one to sell? Sell yours here
A Course in Combinatorics
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

A Course in Combinatorics [Paperback]

J. H. van Lint (Author), R. M. Wilson (Author)
4.6 out of 5 stars  See all reviews (5 customer reviews)


Available from these sellers.


Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Hardcover --  
Paperback $63.26  
Paperback, January 29, 1993 --  
There is a newer edition of this item:
A Course in Combinatorics A Course in Combinatorics 4.6 out of 5 stars (5)
$63.26
In Stock.

Book Description

January 29, 1993 0521422604 978-0521422604
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.

Customers Who Bought This Item Also Bought


Editorial Reviews

Review

' ... a valuable book ...' The Times Higher Education Supplement

Book 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.

Product Details

  • Paperback: 542 pages
  • Publisher: Cambridge University Press (January 29, 1993)
  • Language: English
  • ISBN-10: 0521422604
  • ISBN-13: 978-0521422604
  • Product Dimensions: 9.5 x 6.8 x 1.3 inches
  • Shipping Weight: 2.4 pounds
  • Average Customer Review: 4.6 out of 5 stars  See all reviews (5 customer reviews)
  • Amazon Best Sellers Rank: #2,008,645 in Books (See Top 100 in Books)

More About the Authors

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

5 Reviews
5 star:
 (3)
4 star:
 (2)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.6 out of 5 stars (5 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

37 of 41 people found the following review helpful:
4.0 out of 5 stars A gentle introduction to combinatorics, July 22, 2000
By A Customer
This review is from: A Course in Combinatorics (Paperback)
This book was the text for a graduate-level course I took. The presentation is very laid-back, much like the lecturing style of one of the authors (Wilson), and so it was quite readable (unlike many other math books which you have to stop every few pages and pick apart everything before it sinks in).

Combinatorics is a relatively recent development in mathematics, one which is generally easy to explain, but with many difficult open questions. Van Lint and Wilson do an excellent job explaining, but there are a few places where the reader needs to know some background to place the particular problem in the appropriate mathematical context. Understandably, if the authors were to include all the mathematical machinery needed, the book would be huge! Instead, they have chosen to describe as many facets of the field as possible, and therefore have written a broad, well-balanced book which approaches the topic in a non-threatening way.

My one criticism, then, is that there is a lack of depth in several areas of the book, with further discussion of advanced topics or open problems. But even so, I can appreciate the omission for the sake of accessibility.

To fully appreciate the subject, the authors are correct in mentioning that the book is written with the graduate student in mind. But by no means does the reader require such a background to appreciate the remarkable concepts and the exciting questions revealed in this book.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


12 of 12 people found the following review helpful:
4.0 out of 5 stars Excellent book, but organized in a unorthodox and inconvenient manner, June 11, 2006
I think this is an excellent book but I have a few concerns about its organization.

The writing is very clear and there is a lot of explanation. Exercises are mixed in with the text, which I like very much; it makes them seem more natural, and it makes the book well-suited for self-study. I would say the difficulty level of this book is a bit inconsistent--but this is more a function of the material than of the writing style. The authors make everything as clear as possible, but they choose to include some difficult topics which require more thought.

My main criticism of this book is about the order of topics, which is not only unorthodox but can be inconvenient as well. Many concepts which are often presented earlier in combinatorics texts, such as binomial coefficients and stirling numbers, are relegated to later chapters, where their presentation depends on results from earlier chapters. I find it difficult to skip around in this book--if you do not read it from the beginning, in order, it will be hard to follow the arguments in some of the chapters. This sort of dependency is something I can accept in a more advanced text but I think is inappropriate for a text at this level.

I think this is an excellent book to add to your collection, but if you're going to grab only one or two books in combinatorics I would recommend other books. The organization issues I mentioned could make this book hard to use as a standalone text for a course if you did not wish to follow the same course of development chosen by the authors. Cameron's book is written at a similar level and covers a similar amount of material (although it has a very different style of presentation), and it is much easier to skip around in. Stanley's "Enumerative Combinatorics" is a denser, more advanced text that most will find more difficult to follow than this book, but it is still easier to skip around in as well.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


13 of 14 people found the following review helpful:
5.0 out of 5 stars A nice tour of combinatorics, November 18, 2003
By A Customer
The first word that comes to my mind when I think of this text is "encyclopedic". It contains around 40 chapters, hitting most of the high points of combinatorics that a graduate student should see. The exposition is generally good with nice examples. The one thing that I fault it for is the number of statements that the authors claim are "obvious". In a way, this is good, because it makes you pay attention and understand the material, but sometimes the statement isn't obvious until you've thought about it for an hour and written out a lengthy proof. At that point, it does become completely obvious and you can't believe that you ever thought it wasn't, so I can understand why van Lint and Wilson fell into the trap so often. (In fact, I've heard that Wilson even stumbles over some of those points in lectures.) This is a great book to have on your shelf if you need somewhere to look up combinatorial ideas.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Most Recent Customer Reviews



Only search this product's reviews



Inside This Book (learn more)
First Sentence:
A graph G consists of a set V (or V(G)) of vertices, a set E (or E(G)) of edges, and a mapping associating to each edge e E(G) an unordered pair x,y of vertices called the endpoints (or simply the ends) of e. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
grand cliques, quasiresidual design, cutset space, monovalent vertex, planar difference sets, incidence structure whose points, vertex condition, cyclic difference sets, minimizing matrix, hermitian variety, strongly regular graph, partial geometry, trivalent graph, squarefree part, partial geometries, squared rectangles, conference matrix, corresponding quadric, exponential generating function, local permutation, projective points, coordinates indexed, weight enumerator, simple closed path, vertex terms
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Cambridge University Press, London Math, Academic Press, Discrete Math, Lecture Notes, Carus Math, Combinatorial Mathematics, Lecture Note Series, Duke Math, Five Color Theorem, Sir William Rowan Hamilton
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:





Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums





Look for Similar Items by Category


Look for Similar Items by Subject