Combinatorics and Graph Theory (Undergraduate Texts in Mathematics)

Harris, John M.; Hirst, Jeffry L.; Mossinghoff, Michael

ISBN 10: 1441927239 ISBN 13: 9781441927231
Verlag: Springer (edition Softcover reprint of hardcover 2nd ed. 2008), 2010
Gebraucht Paperback

Verkäufer BooksRun, Philadelphia, PA, USA Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

AbeBooks-Verkäufer seit 2. Februar 2016


Beschreibung

Beschreibung:

It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Softcover reprint of hardcover 2nd ed. 2008. Bestandsnummer des Verkäufers 1441927239-8-1

Diesen Artikel melden

Inhaltsangabe:

There are certain rules that one must abide by in order to create a successful sequel. — Randy Meeks, from the trailer to Scream 2 While we may not follow the precise rules that Mr. Meeks had in mind for s- cessful sequels, we have made a number of changes to the text in this second edition. In the new edition, we continue to introduce new topics with concrete - amples, we provide complete proofs of almost every result, and we preserve the book’sfriendlystyle andlivelypresentation,interspersingthetextwith occasional jokes and quotations. The rst two chapters, on graph theory and combinatorics, remain largely independent, and may be covered in either order. Chapter 3, on in nite combinatorics and graphs, may also be studied independently, although many readers will want to investigate trees, matchings, and Ramsey theory for nite sets before exploring these topics for in nite sets in the third chapter. Like the rst edition, this text is aimed at upper-division undergraduate students in mathematics, though others will nd much of interest as well. It assumes only familiarity with basic proof techniques, and some experience with matrices and in nite series. The second edition offersmany additionaltopics for use in the classroom or for independentstudy. Chapter 1 includesa new sectioncoveringdistance andrelated notions in graphs, following an expanded introductory section. This new section also introduces the adjacency matrix of a graph, and describes its connection to important features of the graph.

Von der hinteren Coverseite:

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

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Bibliografische Details

Titel: Combinatorics and Graph Theory (...
Verlag: Springer (edition Softcover reprint of hardcover 2nd ed. 2008)
Erscheinungsdatum: 2010
Einband: Paperback
Zustand: Very Good
Auflage: 2. Auflage

Beste Suchergebnisse beim ZVAB

Beispielbild für diese ISBN

Harris, John; Hirst, Jeffry L.; Mossinghoff, Michael
Verlag: Springer, 2010
ISBN 10: 1441927239 ISBN 13: 9781441927231
Gebraucht Paperback

Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Paperback. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Artikel-Nr. G1441927239I4N00

Verkäufer kontaktieren

Gebraucht kaufen

EUR 20,91
Versand gratis
Versand innerhalb von USA

Anzahl: 1 verfügbar

In den Warenkorb

Foto des Verkäufers

John Harris
Verlag: Springer New York, 2010
ISBN 10: 1441927239 ISBN 13: 9781441927231
Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - There are certain rules that one must abide by in order to create a successful sequel. - Randy Meeks, from the trailer to Scream 2 While we may not follow the precise rules that Mr. Meeks had in mind for s- cessful sequels, we have made a number of changes to the text in this second edition. In the new edition, we continue to introduce new topics with concrete - amples, we provide complete proofs of almost every result, and we preserve the book'sfriendlystyle andlivelypresentation,interspersingthetextwith occasional jokes and quotations. The rst two chapters, on graph theory and combinatorics, remain largely independent, and may be covered in either order. Chapter 3, on in nite combinatorics and graphs, may also be studied independently, although many readers will want to investigate trees, matchings, and Ramsey theory for nite sets before exploring these topics for in nite sets in the third chapter. Like the rst edition, this text is aimed at upper-division undergraduate students in mathematics, though others will nd much of interest as well. It assumes only familiarity with basic proof techniques, and some experience with matrices and in nite series. The second edition offersmany additionaltopics for use in the classroom or for independentstudy. Chapter 1 includesa new sectioncoveringdistance andrelated notions in graphs, following an expanded introductory section. This new section also introduces the adjacency matrix of a graph, and describes its connection to important features of the graph. Artikel-Nr. 9781441927231

Verkäufer kontaktieren

Neu kaufen

EUR 49,57
EUR 62,87 shipping
Versand von Deutschland nach USA

Anzahl: 2 verfügbar

In den Warenkorb