Combinatorics and graph theory
(Book)

Book Cover
Average Rating
Status
General Shelving - 3rd Floor
QA165 .H37 2000
1 available

Description

Loading Description...

Also in this Series

Checking series information...

Copies

LocationCall NumberStatus
General Shelving - 3rd FloorQA165 .H37 2000On Shelf

More Like This

Loading more titles like this title...

More Details

Format
Book
Physical Desc
xiii, 225 pages : illustrations ; 25 cm.
Language
English
UPC
9780387987361

Notes

Bibliography
Includes bibliographical references (pages 211-217) and index.
Description
"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 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."--Jacket.
Local note
SACFinal081324

Reviews from GoodReads

Loading GoodReads Reviews.

Citations

APA Citation, 7th Edition (style guide)

Harris, J. M. 1., Hirst, J. L., & Mossinghoff, M. J. (2000). Combinatorics and graph theory . Springer.

Chicago / Turabian - Author Date Citation, 17th Edition (style guide)

Harris, John M. 1969-, Jeffry L. Hirst and Michael J. Mossinghoff. 2000. Combinatorics and Graph Theory. New York: Springer.

Chicago / Turabian - Humanities (Notes and Bibliography) Citation, 17th Edition (style guide)

Harris, John M. 1969-, Jeffry L. Hirst and Michael J. Mossinghoff. Combinatorics and Graph Theory New York: Springer, 2000.

Harvard Citation (style guide)

Harris, J. M. 1., Hirst, J. L. and Mossinghoff, M. J. (2000). Combinatorics and graph theory. New York: Springer.

MLA Citation, 9th Edition (style guide)

Harris, John M. 1969-, Jeffry L. Hirst, and Michael J. Mossinghoff. Combinatorics and Graph Theory Springer, 2000.

Note! Citations contain only title, author, edition, publisher, and year published. Citations should be used as a guideline and should be double checked for accuracy. Citation formats are based on standards as of August 2021.

Staff View

Loading Staff View.