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 ...
Read More
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.
Read Less
Add this copy of Combinatorics and Graph Theory (Undergraduate Texts in to cart. $9.12, very good condition, Sold by Books From California rated 4.0 out of 5 stars, ships from Simi Valley, CA, UNITED STATES, published 2008 by Springer.
Add this copy of Combinatorics and Graph Theory to cart. $9.43, very good condition, Sold by ThriftBooks-Dallas rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 2008 by Springer.
Add this copy of Combinatorics and Graph Theory to cart. $20.97, good condition, Sold by ThriftBooks-Reno rated 5.0 out of 5 stars, ships from Reno, NV, UNITED STATES, published 2000 by Springer.
Add this copy of Combinatorics and Graph Theory (Undergraduate Texts in to cart. $21.01, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 2000 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Combinatorics and Graph Theory (Undergraduate Texts in to cart. $24.99, good condition, Sold by Goodwill of Silicon Valley rated 5.0 out of 5 stars, ships from San Jose, CA, UNITED STATES, published 2000 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Good condition! Any other included accessories are also in Good condition showing use. Use can include some highlighting and writing page and cover creases as well as other types visible wear.
