Taylor's Library

Normal view MARC view ISBD view

Combinatorics and graph theory / John M. Harris, Jeffry L. Hirst, Michael J. Mossinghoff

By: Harris, John M. (John Michael), 1969-.
Contributor(s): Hirst, Jeffry L, 1957- [(j.a.)] | Mossinghoff, Michael J, 1964- [(j.a.)].
Series: Undergraduate texts in mathematics / editors S. Axler, F.W. Gehring, K.A. Ribet. Publisher: N.Y. : Springer, c2000Description: xiii, 225 p. : ill. ; 25 cm.ISBN: 0387987363.Subject(s): Combinatorial analysis | Graph theoryDDC classification: 511.6
Contents:
Preface. - 1. Graph Theory. 1.1. Introductory Concepts. 1.2. Trees. 1.3. Palanarity. 1.4. Colorings. 1.5. Matchings. 1.6. Ramsey Theory. - 2. Combinatorics. 2.1. Three Basic Problems. 2.2. Binomial Coefficients. 2.3. The Principles of Inclusion and Extension. 2.4. Generating Functions. 2.5. Polya's Theory of Counting. 2.6. More Numbers. 2.7. Stable marriage. 2.8. References. - 3. Infinite Combinatorics and Graphs. 3.1. Pigeons and Trees. 3.2. Ramsey Revisited. 3.3. ZFC. 3.4. The Return of der Konig. 3.5. Ordinals, Cardinals and Many Pigeons. 3.6. Incompleteness and Cardinals. 3.7. Weakly Compact Cardinals. 3.8. Finite Combinatorics with Infinite Consequences. 3.9. Points of Departure. 3.10. References. - References. - Index.
Item type Current location Call number Copy number Status Notes Date due Barcode
Main Collection Taylor's Library-TU
511.6 HAR (Browse shelf) 1 Available SOCIT,15009,03,GR 5000031814

With 124 Illustrations

Preface. - 1. Graph Theory. 1.1. Introductory Concepts. 1.2. Trees. 1.3. Palanarity. 1.4. Colorings. 1.5. Matchings. 1.6. Ramsey Theory. - 2. Combinatorics. 2.1. Three Basic Problems. 2.2. Binomial Coefficients. 2.3. The Principles of Inclusion and Extension. 2.4. Generating Functions. 2.5. Polya's Theory of Counting. 2.6. More Numbers. 2.7. Stable marriage. 2.8. References. - 3. Infinite Combinatorics and Graphs. 3.1. Pigeons and Trees. 3.2. Ramsey Revisited. 3.3. ZFC. 3.4. The Return of der Konig. 3.5. Ordinals, Cardinals and Many Pigeons. 3.6. Incompleteness and Cardinals. 3.7. Weakly Compact Cardinals. 3.8. Finite Combinatorics with Infinite Consequences. 3.9. Points of Departure. 3.10. References. - References. - Index.