- Hardcover: 208 pages
- Publisher: Wiley-Interscience; 2 edition (Mar 2 1990)
- Language: English
- ISBN-10: 0471500461
- ISBN-13: 978-0471500469
- Product Dimensions: 24 x 16.5 x 1.9 cm
- Shipping Weight: 458 g
- Amazon Bestsellers Rank: #2,074,772 in Books (See Top 100 in Books)
- See Complete Table of Contents
|
||||||||||||||||||
|
||||||||||||||||||
|
||||||||||||||||||
| ||||||||||||
Product Details |
Product Description
Review
"Anyone interested in getting an introduction to Ramsey theory will find this illuminating…" (MAA Reviews, December 17, 2006)
Book Description
Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory
Editors: Ronald L. Graham, Jan Karel Lenstra, and Robert E. Tarjan
Discrete mathematics, the study of finite structures, is one of the fastest-growing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the ever-increasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record of the extraordinary development of this field. A complete listing of the titles in the Series appears on the inside front cover of this book.
"[Integer and Combinatorial Optimization] is a major contribution to the literature of discrete programming. This text should be required reading for anybody who intends to research this area or even just to keep abreast of developments."
--Times Higher Education Supplement, London
"An extensive but extremely well-written graduate text covering integer programming."
--American Mathematical Monthly
Recent titles in the Series include:
Integer and Combinatorial Optimization George L. Nemhauser and Laurence A. Wolsey 1988 (0 471-82819-X) 763 pp.
Introduction to the Theory of Error-Correcting Codes Second Edition Vera Pless
For mathematicians, engineers, and computer scientists, here is an introduction to the theory of error-correcting codes, focusing on linear block codes. The book considers such codes as Hamming and Golay codes, correction of double errors, use of finite fields, cyclic codes, B.C.H. codes, weight distributions, and design of codes. In a second edition of the book, Pless offers thoroughly expanded coverage of nonbinary and cyclic codes. Some proofs have been simplified, and there are many more examples and problems. 1989 (0 471-61884-5) 224 pp.
Editors: Ronald L. Graham, Jan Karel Lenstra, and Robert E. Tarjan
Discrete mathematics, the study of finite structures, is one of the fastest-growing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the ever-increasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record of the extraordinary development of this field. A complete listing of the titles in the Series appears on the inside front cover of this book.
"[Integer and Combinatorial Optimization] is a major contribution to the literature of discrete programming. This text should be required reading for anybody who intends to research this area or even just to keep abreast of developments."
--Times Higher Education Supplement, London
"An extensive but extremely well-written graduate text covering integer programming."
--American Mathematical Monthly
Recent titles in the Series include:
Integer and Combinatorial Optimization George L. Nemhauser and Laurence A. Wolsey 1988 (0 471-82819-X) 763 pp.
Introduction to the Theory of Error-Correcting Codes Second Edition Vera Pless
For mathematicians, engineers, and computer scientists, here is an introduction to the theory of error-correcting codes, focusing on linear block codes. The book considers such codes as Hamming and Golay codes, correction of double errors, use of finite fields, cyclic codes, B.C.H. codes, weight distributions, and design of codes. In a second edition of the book, Pless offers thoroughly expanded coverage of nonbinary and cyclic codes. Some proofs have been simplified, and there are many more examples and problems. 1989 (0 471-61884-5) 224 pp.
Inside This Book
(Learn More)
First Sentence
In any collection of six people either three of them mutually know each other or three of them mutually do not know each other. Read the first page
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
In any collection of six people either three of them mutually know each other or three of them mutually do not know each other. Read the first page
Explore More
Concordance
Browse Sample PagesConcordance
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Reviews
|
There are no customer reviews yet on Amazon.ca
|
||||||||||||||||||||
|
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
1.0 out of 5 stars (1 customer review)
24 of 25 people found the following review helpful
1.0 out of 5 stars
Why do you hate us, Wiley Interscience?, Jun 30 2008
By Pietro K. Carolino "What's that? Is it a prob... - Published on Amazon.com
This review is from: Ramsey Theory (Hardcover)
This book is pretty nice; it covers many of the central advances in modern combinatorics, which would otherwise be hard to find in a single place. It doesn't contain anything new, but it does a good job getting the content across.However, for some inexplicable reason, Wiley Interscience seem to hate their readership, and have foisted on us a completely absurd US$ 147 price tag on a 200-page book, which, discounting reproductions of classical papers (Ramsey and Erdos-Szekeres) and bibliography, boasts 180 pages of actual content.
Honestly, what is the point of having a convenient, unified and concise reference on combinatorics, if with the same amount of cash I can buy three or four full-sized books and have about a third of a very respectable combinatorics *library*? It should set off everybody's spider-sense that this book costs almost twice as much as "Additive Combinatorics" (Tao & Vu), which is 2.5 times longer, 15 years more up-to-date, covers at least half the material in "Ramsey Theory", and actually invites you to participate in the goings-on (i.e. has exercises, and excellent ones at that).
For US$ 20 this might have been an excellent buy.
Listmania!
Look for similar items by category
- Books > Professional & Technical > Professional Science > Mathematics > Applied
- Books > Professional & Technical > Professional Science > Mathematics > Mathematical Analysis
- Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics
- Books > Qualifying Textbooks - Fall 2007 > Science
- Books > Science > Mathematics > Applied > Graph Theory
- Books > Science > Mathematics > Mathematical Analysis
- Books > Science > Mathematics > Pure Mathematics > Combinatorics
- Books > Science > Mathematics > Pure Mathematics > Discrete Mathematics
Look for similar items by subject
Feedback
Would you like to update product info or give feedback on images?
|
