Combinatorics and Graph Theory

Free Download

Authors:

Edition: 2

Series: Undergraduate Texts in Mathematics

ISBN: 9781441927231, 1441927239

Size: 5 MB (5665827 bytes)

Pages: 381/391

File format:

Language:

Publishing Year:

Category: Tags: ,

John Harris, Jeffry L. Hirst, Michael Mossinghoff (auth.)9781441927231, 1441927239

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

Reviews

There are no reviews yet.

Be the first to review “Combinatorics and Graph Theory”
Shopping Cart
Scroll to Top