Combinatorics And Graph Theory (Undergraduate Texts in Mathematics) - Hardcover

Harris, John-M; Hirst, Jeffry-L; Mossinghoff, Michael-J

Hardcover

ISBN 10: 0387987363 ISBN 13: 9780387987361

Verlag: Springer Verlag, 2000

Inhaltsangabe

Book by John M Harris Jeffry L Hirst Michael J Mossinghoff

Über diesen Titel

Críticas:

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"

Reseña del editor:

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.

Über diese Auflage

• Verlag: Springer Verlag
• Erscheinungsdatum: 2000
• ISBN 10: 0387987363
• ISBN 13: 9780387987361
• Einband: Tapa dura
• Anzahl der Seiten: 230