Covering important results and current trends and issues across the spectrum of combinatorics, this volume covers finite sets and relations, matroids, symmetric structures, and combinatorial structures in geometry and number theory.
--This text refers to the
Hardcover
edition.
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||
Book Description
Editorial Reviews
Review
"If you need to know about the...applications of discrete structures, you'll probably find whatever you're looking for here."
— IEEE Micro Review
"The Handbook of Combinatorics will be a work of quality and significance in what has become, over the past 20 years, one of the most active and fruitful areas of mathematical research. The editors, who are top people in the field, have collected a distinguished group of authors. The Handbook will be a major and central scholarly work."
—Hartley Rogers, Jr., Professor, Massachusetts Institute of Technology --This text refers to an out of print or unavailable edition of this title.
— IEEE Micro Review
"The Handbook of Combinatorics will be a work of quality and significance in what has become, over the past 20 years, one of the most active and fruitful areas of mathematical research. The editors, who are top people in the field, have collected a distinguished group of authors. The Handbook will be a major and central scholarly work."
—Hartley Rogers, Jr., Professor, Massachusetts Institute of Technology --This text refers to an out of print or unavailable edition of this title.
About the Author
Ronald L. Graham is Irwin and Joan Jacobs Professor in the Department of Computer Science and Engineering and Chief Scientist of the California Institute for Telecommunications and Information Technology, University of California, San Diego.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
7 of 7 people found the following review helpful:
5.0 out of 5 stars
Get your library to get this.,
By A Customer
This review is from: Handbook of Combinatorics, Vol. 1 (Paperback)
This is a collection of survey articles by various top class mathematicians about combinatorics, and the links the subject has with other branches of knowledge, from topology to biology. I have only read a couple of chapters in any detail and they were very useful. If you are in combinatorics, you must have access to this. The expense is worth it.
3 of 5 people found the following review helpful:
3.0 out of 5 stars
A collection of papers, not a handbook at all,
By R. Bagula "Roger L. Bagula" (Lakeside, Ca United States) - See all my reviews (VINE VOICE) (REAL NAME)
This review is from: HANDBOOK OF COMBINATORICS VOLUME 1, Volume I (Hardcover)
An handbook is usually a little fact book with just the facts
presented in as understandable a fashion as possible. You have to look at this book from a price to benefit point of view. Most of these research / survey papers are just not presented in a teaching mode: more of a theorem and proof mode with references. The price tag per volume is over 200 dollars. My bet is that libraries and the authors are the main market, with most poor graduate students and post grads not being able to afford the volumes at a price for both at of $400. The material is dense and not presented in enough detail that the result is very useful to a student. Here we have more ego than scholarship as a result?
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
First Sentence:
A graph G consists of a nonempty set V(G) of elements, called vertices or nodes, and a set E(G) of elements called edges, together with a relation of incidence that associates with each edge two vertices, called its ends. Read the first page Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, New York, London Math, Academic Press, Cambridge University Press, Lecture Notes, Acta Math, Las Vergnas, Discrete Comput, Utilitas Math, Elsevier Science, Mathematisch Centrum, Ars Combin, Selected Topics, Cambridge Philos, Discrete Appl, Pure Math, Theory of Computing, Gallai-Milgram Theorem, Gallai-Roy Theorem, Bridge Lemma, Oxford University Press, University of Waterloo, Department of Mathematics, Mathematical Association of America New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
A graph G consists of a nonempty set V(G) of elements, called vertices or nodes, and a set E(G) of elements called edges, together with a relation of incidence that associates with each edge two vertices, called its ends. Read the first page Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, New York, London Math, Academic Press, Cambridge University Press, Lecture Notes, Acta Math, Las Vergnas, Discrete Comput, Utilitas Math, Elsevier Science, Mathematisch Centrum, Ars Combin, Selected Topics, Cambridge Philos, Discrete Appl, Pure Math, Theory of Computing, Gallai-Milgram Theorem, Gallai-Roy Theorem, Bridge Lemma, Oxford University Press, University of Waterloo, Department of Mathematics, Mathematical Association of America New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Books on Related Topics
(learn more)
|
|
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
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
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
