𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Combinatorics and Graph Theory

✍ Scribed by John Harris, Jeffry L. Hirst, Michael Mossinghoff (auth.)


Publisher
Springer-Verlag New York
Year
2008
Tongue
English
Leaves
392
Series
Undergraduate Texts in Mathematics
Edition
2
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


This book covers a wide variety of topics in combinatorics and graph theory. 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 second edition includes many new topics and features:

β€’ New sections in graph theory on distance, Eulerian trails, and Hamiltonian paths.

β€’ New material on partitions, multinomial coefficients, and the pigeonhole principle.

β€’ Expanded coverage of PΓ³lya Theory to include de Bruijn’s method for counting arrangements when a second symmetry group acts on the set of allowed colors.

β€’ Topics in combinatorial geometry, including Erdos and Szekeres’ development of Ramsey Theory in a problem about convex polygons determined by sets of points.

β€’ Expanded coverage of stable marriage problems, and new sections on marriage problems for infinite sets, both countable and uncountable.

β€’ Numerous new exercises throughout the book.

About the First Edition:

". . . this is what a textbook should be! The book is comprehensive without being overwhelming, the proofs are elegant, clear and short, and the examples are well picked."

β€” Ioana Mihaila, MAA Reviews

✦ Table of Contents


Front Matter....Pages i-xv
Graph Theory....Pages 1-127
Combinatorics....Pages 129-280
Infinite Combinatorics and Graphs....Pages 281-353
Back Matter....Pages 355-381

✦ Subjects


Combinatorics; Mathematical Logic and Foundations


πŸ“œ SIMILAR VOLUMES


Combinatorics and graph theory
✍ John Harris, Jeffry L. Hirst, Michael Mossinghoff (auth.) πŸ“‚ Library πŸ“… 2008 πŸ› Springer-Verlag New York 🌐 English

<p><P>This book covers a wide variety of topics in combinatorics and graph theory. 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

Combinatorics and Graph Theory
✍ John Harris, Jeffry L. Hirst, Michael Mossinghoff πŸ“‚ Library πŸ“… 2008 πŸ› Springer 🌐 English

I find the book to explain exactly what it intends to, providing pertinent examples where useful. I wish there were more examples, actually, but there is something to be said for being concise. The problems are well-organized and good problems. Also, it is a nice, sturdy hardcover version with non-g

Combinatorics and Graph Theory
✍ John M. Harris, Jeffry L. Hirst, Michael J. Mossinghoff (auth.) πŸ“‚ Library πŸ“… 2000 πŸ› Springer New York 🌐 English
Combinatorics and graph theory
✍ Borowiecki, MieczysΕ‚aw;Centre international mathΓ©matique pour le relΓ¨vement de l πŸ“‚ Library πŸ“… 1989 πŸ› PWN-Polish Scientific Publishers 🌐 English
Combinatorics and Graph Theory
✍ Harris, John M πŸ“‚ Library πŸ“… 2008 πŸ› Springer Science+Business Media 🌐 English

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