Nicht aus der Schweiz? Besuchen Sie lehmanns.de
A Combinatorics and Graph Theory - John M. Harris, Jeffry L. Hirst, Michael J. Mossinghoff

A Combinatorics and Graph Theory

Buch | Hardcover
238 Seiten
2000
Springer-Verlag New York Inc.
978-0-387-98736-1 (ISBN)
CHF 67,30 inkl. MwSt
  • Titel erscheint in neuer Auflage
  • Artikel merken
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.
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, Polya theory, the stable marriage problem, and several important classes of numbers. Chapter 3 presents infinite pigeonhole principles, Konig'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.

Graph Theory: Introductory Concepts.- Trees.- Planarity.- Colorings.- Matchings.- Ramsey Theory.- References; Combinatorics: Three Basic Problems.- Binomial Coefficients.- The Principle of Inclusion and Exclusion.- Generating Functions.- Polya's Theory of Counting.- More Numbers.- Stable Marriage.- References; Infinite Combinatorics and Graph Theory: Pigeons and Trees.- Ramsey Revisited.- ZFC.- The Return of der Koenig.- Ordinals, Cardinals, and Many Pigeons.- Incompleteness and Coardinals.- Weakly Compact Cardinals.- Finite Combinatorics with Infinite Consequences.- Points of Departure.- References.

Erscheint lt. Verlag 1.8.2000
Reihe/Serie Undergraduate Texts in Mathematics
Zusatzinfo 124 illus.
Verlagsort New York, NY
Sprache englisch
Maße 156 x 234 mm
Gewicht 526 g
Einbandart gebunden
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
ISBN-10 0-387-98736-3 / 0387987363
ISBN-13 978-0-387-98736-1 / 9780387987361
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich