Cover of Combinatorics and graph theory

Science & Nature

Combinatorics and graph theory

Rating
–
No ratings yet.
Pages
266
3 editions
First published
2000
1 language

Overview

This book evolved from several courses in combinatorics and graph theory given at Appalachian State University and UCLA. Chapter 1 focuses on finite graph theory, including trees, planarity, coloring, matchings, and Ramsey theory. Chapter 2 studies combinatorics, including the principle of inclusion and exclusion, generating functions, recurrence relations, Pólya theory, the stable marriage problem, and several important classes of numbers. Chapter 3 presents infinite pigeonhole principles, König's lemma, and Ramsey's theorem, and discusses their connections to axiomatic set theory. The text is written in an enthusiastic and lively style. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline. The text is primarily directed toward upper-division undergraduate students, but lower-division undergraduates with a penchant for proof and graduate students seeking an introduction to these subjects will also find much of interest.

Ratings & reviews

Log in to rate or review this book.

No written reviews yet.

Discussions

Talk about this book with other readers.

Log in to start a discussion.

No discussions yet.

Editions

  • Format not known Springer New York 2013 228 pages English ISBN 9781475748031 Open Library
  • Format not known Springer 2008 English ISBN 9780387797113 Open Library
  • Format not known Springer 2000 304 pages English ISBN 9780387987361 Open Library

Details & links

First published
2000
Pages
266
Languages
Available in 1 language

Where to buy this book: see “Buy this book”

More about this book

See it on Goodreads →

Read a sample, borrow it or see other editions → openlibrary.org