Research Catalog
A walk through combinatorics : an introduction to enumeration and graph theory
- Title
- A walk through combinatorics : an introduction to enumeration and graph theory / Miklós Bóna.
- Author
- Bóna, Miklós.
- Publication
- River Edge, NJ : World Scientific, ©2002.
Items in the Library & Off-site
Filter by
1 Item
Status | Format | Access | Call Number | Item Location |
---|---|---|---|---|
Text | Use in library | QA164 .B66 2002 | Off-site |
Details
- Description
- xvii, 406 pages : illustrations; 24 cm
- Subject
- Bibliography (note)
- Includes bibliographical references (pages 401-402) and index.
- Contents
- I. Basic Methods -- Ch. 1. Seven Is More Than Six. The Pigeon-Hole Principle -- Ch. 2. One Step at a Time. The Method of Mathematical Induction -- II. Enumerative Combinatorics -- Ch. 3. There Are A Lot Of Them. Elementary Counting Problems -- Ch. 4. No Matter How You Slice It. The Binomial Theorem and Related Identities -- Ch. 5. Divide and Conquer. Partitions -- Ch. 6. Not So Vicious Cycles. Cycles in Permutations -- Ch. 7. You Shall Not Overcount. The Sieve -- Ch. 8. A Function Is Worth Many Numbers. Generating Functions -- III. Graph Theory -- Ch. 9. Dots and Lines. The Origins of Graph Theory -- Ch. 10. Staying Connected. Trees -- Ch. 11. Finding A Good Match. Coloring and Matching -- Ch. 12. Do Not Cross. Planar Graphs -- IV. Horizons -- Ch. 13. Does It Clique? Ramsey Theory -- Ch. 14. So Hard To Avoid. Subsequence Conditions on Permutations -- Ch. 15. Who Knows What It Looks Like, But It Exists. The Probabilistic Method -- Ch. 16. At Least Some Order. Partial Orders and Lattices.
- ISBN
- 9810249004
- 9789810249007
- 9810249012
- 9789810249014
- LCCN
- 2002069144
- OCLC
- ocm49679553
- 49679553
- SCSB-1257163
- Owning Institutions
- Princeton University Library