| eBook ISBN: | 978-1-61444-014-7 |
| Product Code: | CAR/14.E |
| List Price: | $55.00 |
| MAA Member Price: | $41.25 |
| AMS Member Price: | $41.25 |
| eBook ISBN: | 978-1-61444-014-7 |
| Product Code: | CAR/14.E |
| List Price: | $55.00 |
| MAA Member Price: | $41.25 |
| AMS Member Price: | $41.25 |
-
Book DetailsThe Carus Mathematical MonographsVolume: 14; 1963; 154 pp
Herbert J. Ryser is widely regarded as one of the major figures in combinatorics in the 20th century. His Combinatorial Mathematics is a classic which has enticed many young mathematics students into this area.
-
Table of Contents
-
Chapters
-
Chapter 1. Fundamentals of combinatorial mathematics
-
Chapter 2. The principle of inclusion and exclusion
-
Chapter 3. Recurrence relations
-
Chapter 4. A theorem of Ramsey
-
Chapter 5. Systems of distinct representatives
-
Chapter 6. Matrices of zeros and ones
-
Chapter 7. Orthogonal Latin squares
-
Chapter 8. Combinatorial designs
-
Chapter 9. Perfect difference sets
-
-
Additional Material
-
Reviews
-
This polished and readable account of some fascinating aspects of the subject is devoted mainly to existence problems including several basic, original contributions made by the author himself ... the subject is justly known for its difficulty, and Ryser is to be congratulated for his clear presentation. The exposition is supplemented by a good index and an appropriate bibliography for each chapter. An attractive feature is the mention of various interesting, unsolved problems in which the field abounds.
Victor Klee, Science
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Additional Material
- Reviews
- Requests
Herbert J. Ryser is widely regarded as one of the major figures in combinatorics in the 20th century. His Combinatorial Mathematics is a classic which has enticed many young mathematics students into this area.
-
Chapters
-
Chapter 1. Fundamentals of combinatorial mathematics
-
Chapter 2. The principle of inclusion and exclusion
-
Chapter 3. Recurrence relations
-
Chapter 4. A theorem of Ramsey
-
Chapter 5. Systems of distinct representatives
-
Chapter 6. Matrices of zeros and ones
-
Chapter 7. Orthogonal Latin squares
-
Chapter 8. Combinatorial designs
-
Chapter 9. Perfect difference sets
-
This polished and readable account of some fascinating aspects of the subject is devoted mainly to existence problems including several basic, original contributions made by the author himself ... the subject is justly known for its difficulty, and Ryser is to be congratulated for his clear presentation. The exposition is supplemented by a good index and an appropriate bibliography for each chapter. An attractive feature is the mention of various interesting, unsolved problems in which the field abounds.
Victor Klee, Science
