Combinatorics and Graph Theory
John-M Harris, Jeffry-L Hirst, Michael-J Mossinghoff
This book evolved from several courses in combinatories and graph theory given et Appalachian State University and UCLA. Chapter 1 focuses on finite graph theory, including trees, planarity, coloring, matching, and Ramsey theory. Chapter 2 studies combinatories, 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, König's lemma, and Ramsey's theorem, and discusses their connections to axiomatic set theory. The text is written in an enthusiastic und 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 fort 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.
Par
John-M Harris, Jeffry-L Hirst, Michael-J Mossinghoff
Chez
Springer Verlag
Editeur
Genre
Mathématiques
04/08/2000
230
pages
43,80
€
Extraits
Top Articles
Les ventes du livre de Meurice tombées dans l'oreille d'un Praud (assez anti...) “Désarroi et colère” : France Inter supprime La Librairie francophone En librairie : “Ne plus rien prendre pour faire vivoter les livres déjà là” La Librairie Francophone, c'est fini : "On est complètement sonné"
Commenter ce livre