| Combinatorics and Graph Theory Contributor(s): Harris, John (Author), Hirst, Jeffry L. (Author), Mossinghoff, Michael (Author) |
|
 |
ISBN: 1441927239 ISBN-13: 9781441927231 Publisher: Springer OUR PRICE: $52.20 Product Type: Paperback - Other Formats Published: December 2010 |
| Additional Information |
| BISAC Categories: - Mathematics | Combinatorics - Mathematics | Graphic Methods - Mathematics | Discrete Mathematics |
| Dewey: 511.6 |
| Series: Undergraduate Texts in Mathematics |
| Physical Information: 0.9" H x 6.1" W x 9.1" (1.20 lbs) 381 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |