Vous voulez voir cette page en français ? Cliquez ici.

Have one to sell? Sell yours here
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.

Handbook of Combinatorics - Vol. 1 [Paperback]

Ronald L. Graham , Martin Grötschel , László


Available from these sellers.


Formats

Amazon Price New from Used from
Hardcover CDN $275.00  
Paperback --  
Paperback, Jan. 11 1996 --  

Book Description

Jan. 11 1996 Handbook of Combinatorics Vol. 1 (Book 1)
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.

Product Details


Product Description

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.

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.

Inside This Book (Learn More)
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
Explore More
Concordance
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

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 Reviews

There are no customer reviews yet on Amazon.ca
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com: 4.0 out of 5 stars  2 reviews
8 of 8 people found the following review helpful
5.0 out of 5 stars Get your library to get this. April 19 1999
By A Customer - Published on Amazon.com
Format: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.
4 of 7 people found the following review helpful
3.0 out of 5 stars A collection of papers, not a handbook at all May 26 2009
By Roger Bagula - Published on Amazon.com
Format: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?
ARRAY(0xb5362a8c)

Look for similar items by category


Feedback