## Find a copy in the library

Finding libraries that hold this item...

## Details

Material Type: | Internet resource |
---|---|

Document Type: | Book, Internet Resource |

All Authors / Contributors: |
John M Harris; Jeffry L Hirst; Michael J Mossinghoff |

ISBN: | 0387987363 9780387987361 |

OCLC Number: | 42476778 |

Description: | xiii, 225 p. : ill. ; 25 cm. |

Contents: | 1. Graph theory -- 1.1 Introductory concepts -- 1.2 Trees -- 1.3 Planarity -- 1.4 Colorings -- 1.5 Matchings -- 1.6 Ramsey theory -- 1.7 References -- 2. Combinatorics -- 2.1 Three basic problems -- 2.2 Binomial coefficients -- 2.3 The principle of inclusion and exclusion -- 2.4 Generating functions -- 2.5 Pólya'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 König -- 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. |

Series Title: | Undergraduate texts in mathematics. |

Responsibility: | John M. Harris, Jeffry L. Hirst, Michael J. Mossinghoff. |

More information: |

### Abstract:

Evolved from several courses in combinatorics and graph theory. This book contains chapters that: focus on finite graph theory; studies combinatorics; presents infinite pigeonhole principles, K"aounig's Lemma, and Ramsey's Theorem, and discusses their connections to axiomatic set theory.
Read more...

## Reviews

*Editorial reviews*

Publisher Synopsis

From the reviews: SIAM REVIEW "The narrative and proofs are well written, and the authors are given to frequent uses of humor. Students should find this book as easy to read as any other good-quality text written with them in mind. Each of the three chapters concludes with several paragraphs describing an excellent selection of more advanced texts or papers to consider for further study" Read more...

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Combinatorics and graph theory".
Be the first.