Picture 1 of 2
Gallery
Picture 1 of 2
Have one to sell?
Combinatorics and Graph Theory - Paperback, by Harris John M.; - Very Good
US $27.14
ApproximatelyS$ 35.27
Condition:
Very Good
A book that has been read but is in excellent condition. No obvious damage to the cover, with the dust jacket included for hard covers. No missing or damaged pages, no creases or tears, and no underlining/highlighting of text or writing in the margins. May be very minimal identifying marks on the inside cover. Very minimal wear and tear.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free USPS Media MailTM.
Located in: Philadelphia, Pennsylvania, United States
Delivery:
Estimated between Thu, 16 Oct and Wed, 22 Oct to 94104
Returns:
30 days return. Seller pays for return shipping.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:126828079863
Item specifics
- Condition
- Book Title
- Combinatorics and Graph Theory (Undergraduate Texts in Mathematic
- ISBN
- 9781441927231
About this product
Product Identifiers
Publisher
Springer New York
ISBN-10
1441927239
ISBN-13
9781441927231
eBay Product ID (ePID)
109122286
Product Key Features
Number of Pages
Xv, 381 Pages
Publication Name
Combinatorics and Graph Theory
Language
English
Subject
Graphic Methods, Combinatorics, Logic, Discrete Mathematics
Publication Year
2010
Type
Textbook
Subject Area
Mathematics
Series
Undergraduate Texts in Mathematics Ser.
Format
Trade Paperback
Dimensions
Item Weight
21.6 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Edition Number
2
Intended Audience
Scholarly & Professional
Reviews
From the reviews:SIAM REVIEW"The narrative and proofs are well written, and the authors are given to frequent uses of humor. Students should find this book as easy to read as any other good-quality text written with them in mind. Each of the three chapters concludes with several paragraphs describing an excellent selection of more advanced texts or papers to consider for further study"From the reviews of the second edition: 'œAny undergraduate work in combinatorics or graph theory, whether a course or independent study, would likely be well served by this textbook '¦ . The authors offer a wide selection of topics, often in more depth than other undergraduate texts, in an engaging and clear style. '¦ Each chapter concludes with extensive notes on further reading.'� (Brian Hopkins, Mathematical Reviews, Issue 2010 b) 'œCombinatorics and Graph Theory is a popular pair of topics to choose for an undergraduate course. '¦ The book is written in a reader-friendly style and there are enough exercises. '¦ It is certainly good that someone took the effort to write '¦ in a form that is appropriate for undergraduates. '¦ the book will most often be used for a reading class by a student who already has a background in combinatorics and who wants to learn about the set theoretical aspect of it.'� (Miklós Bóna, SIGACT News, Vol. 40 (3), 2009), From the reviews: SIAM REVIEW "The narrative and proofs are well written, and the authors are given to frequent uses of humor. Students should find this book as easy to read as any other good-quality text written with them in mind. Each of the three chapters concludes with several paragraphs describing an excellent selection of more advanced texts or papers to consider for further study" From the reviews of the second edition: "Any undergraduate work in combinatorics or graph theory, whether a course or independent study, would likely be well served by this textbook ... . The authors offer a wide selection of topics, often in more depth than other undergraduate texts, in an engaging and clear style. ... Each chapter concludes with extensive notes on further reading." (Brian Hopkins, Mathematical Reviews, Issue 2010 b) "Combinatorics and Graph Theory is a popular pair of topics to choose for an undergraduate course. ... The book is written in a reader-friendly style and there are enough exercises. ... It is certainly good that someone took the effort to write ... in a form that is appropriate for undergraduates. ... the book will most often be used for a reading class by a student who already has a background in combinatorics and who wants to learn about the set theoretical aspect of it." (Miklós Bóna, SIGACT News, Vol. 40 (3), 2009) "This undergraduate textbook contains three chapters: Graph Theory, Combinatorics and Infinite Combinatorics and Graphs. ... There is a short section on References in each chapter introducing briefly other books dealing with the topics covered in the respective chapter. A full list of 293 references, about 550 exercises and an index with 13 pages are also provided." (Dalibor Froncek, Zentralblatt MATH, Vol. 1170, 2009), From the reviews: SIAM REVIEW "The narrative and proofs are well written, and the authors are given to frequent uses of humor. Students should find this book as easy to read as any other good-quality text written with them in mind. Each of the three chapters concludes with several paragraphs describing an excellent selection of more advanced texts or papers to consider for further study" From the reviews of the second edition: "Any undergraduate work in combinatorics or graph theory, whether a course or independent study, would likely be well served by this textbook ... . The authors offer a wide selection of topics, often in more depth than other undergraduate texts, in an engaging and clear style. ... Each chapter concludes with extensive notes on further reading." (Brian Hopkins, Mathematical Reviews, Issue 2010 b) "Combinatorics and Graph Theory is a popular pair of topics to choose for an undergraduate course. ... The book is written in a reader-friendly style and there are enough exercises. ... It is certainly good that someone took the effort to write ... in a form that is appropriate for undergraduates. ... the book will most often be used for a reading class by a student who already has a background in combinatorics and who wants to learn about the set theoretical aspect of it." (Mikls Bna, SIGACT News, Vol. 40 (3), 2009) "This undergraduate textbook contains three chapters: Graph Theory, Combinatorics and Infinite Combinatorics and Graphs. ... There is a short section on References in each chapter introducing briefly other books dealing with the topics covered in the respective chapter. A full list of 293 references, about 550 exercises and an index with 13 pages are also provided." (Dalibor Froncek, Zentralblatt MATH, Vol. 1170, 2009), From the reviews:SIAM REVIEW"The narrative and proofs are well written, and the authors are given to frequent uses of humor. Students should find this book as easy to read as any other good-quality text written with them in mind. Each of the three chapters concludes with several paragraphs describing an excellent selection of more advanced texts or papers to consider for further study"From the reviews of the second edition: SAny undergraduate work in combinatorics or graph theory, whether a course or independent study, would likely be well served by this textbook . The authors offer a wide selection of topics, often in more depth than other undergraduate texts, in an engaging and clear style. Each chapter concludes with extensive notes on further reading. (Brian Hopkins, Mathematical Reviews, Issue 2010 b) SCombinatorics and Graph Theory is a popular pair of topics to choose for an undergraduate course. The book is written in a reader-friendly style and there are enough exercises. It is certainly good that someone took the effort to write in a form that is appropriate for undergraduates. the book will most often be used for a reading class by a student who already has a background in combinatorics and who wants to learn about the set theoretical aspect of it. (Mikl s B na, SIGACT News, Vol. 40 (3), 2009) SThis undergraduate textbook contains three chapters: Graph Theory, Combinatorics and Infinite Combinatorics and Graphs. There is a short section on References in each chapter introducing briefly other books dealing with the topics covered in the respective chapter. A full list of 293 references, about 550 exercises and an index with 13 pages are also provided. (Dalibor Froncek, Zentralblatt MATH, Vol. 1170, 2009), From the reviews: SIAM REVIEW "The narrative and proofs are well written, and the authors are given to frequent uses of humor. Students should find this book as easy to read as any other good-quality text written with them in mind. Each of the three chapters concludes with several paragraphs describing an excellent selection of more advanced texts or papers to consider for further study" From the reviews of the second edition: "Any undergraduate work in combinatorics or graph theory, whether a course or independent study, would likely be well served by this textbook ... . The authors offer a wide selection of topics, often in more depth than other undergraduate texts, in an engaging and clear style. ... Each chapter concludes with extensive notes on further reading." (Brian Hopkins, Mathematical Reviews, Issue 2010 b) "Combinatorics and Graph Theory is a popular pair of topics to choose for an undergraduate course. ... The book is written in a reader-friendly style and there are enough exercises. ... It is certainly good that someone took the effort to write ... in a form that is appropriate for undergraduates. ... the book will most often be used for a reading class by a student who already has a background in combinatorics and who wants to learn about the set theoretical aspect of it." (Mikls Bna, SIGACT News, Vol. 40 (3), 2009) "This undergraduate textbook contains three chapters: Graph Theory, Combinatorics and Infinite Combinatorics and Graphs. ... There is a short section on References in each chapter introducing briefly other books dealing with the topics covered in the respective chapter. A full list of 293 references, about 550 exercises and an index with 13 pages are also provided." (Dalibor Froncek, Zentralblatt MATH, Vol. 1170, 2009), From the reviews:SIAM REVIEW"The narrative and proofs are well written, and the authors are given to frequent uses of humor. Students should find this book as easy to read as any other good-quality text written with them in mind. Each of the three chapters concludes with several paragraphs describing an excellent selection of more advanced texts or papers to consider for further study"From the reviews of the second edition: Any undergraduate work in combinatorics or graph theory, whether a course or independent study, would likely be well served by this textbook … . The authors offer a wide selection of topics, often in more depth than other undergraduate texts, in an engaging and clear style. … Each chapter concludes with extensive notes on further reading. (Brian Hopkins, Mathematical Reviews, Issue 2010 b) Combinatorics and Graph Theory is a popular pair of topics to choose for an undergraduate course. … The book is written in a reader-friendly style and there are enough exercises. … It is certainly good that someone took the effort to write … in a form that is appropriate for undergraduates. … the book will most often be used for a reading class by a student who already has a background in combinatorics and who wants to learn about the set theoretical aspect of it. (Miklós Bóna, SIGACT News, Vol. 40 (3), 2009)This undergraduate textbook contains three chapters: Graph Theory, Combinatorics and Infinite Combinatorics and Graphs. … There is a short section on References in each chapter introducing briefly other books dealing with the topics covered in the respective chapter. A full list of 293 references, about 550 exercises and an index with 13 pages are also provided. (Dalibor Froncek, Zentralblatt MATH, Vol. 1170, 2009), From the reviews: SIAM REVIEW "The narrative and proofs are well written, and the authors are given to frequent uses of humor. Students should find this book as easy to read as any other good-quality text written with them in mind. Each of the three chapters concludes with several paragraphs describing an excellent selection of more advanced texts or papers to consider for further study" From the reviews of the second edition: "Any undergraduate work in combinatorics or graph theory, whether a course or independent study, would likely be well served by this textbook ... . The authors offer a wide selection of topics, often in more depth than other undergraduate texts, in an engaging and clear style. ... Each chapter concludes with extensive notes on further reading." (Brian Hopkins, Mathematical Reviews, Issue 2010 b) "Combinatorics and Graph Theory is a popular pair of topics to choose for an undergraduate course. ... The book is written in a reader-friendly style and there are enough exercises. ... It is certainly good that someone took the effort to write ... in a form that is appropriate for undergraduates. ... the book will most often be used for a reading class by a student who already has a background in combinatorics and who wants to learn about the set theoretical aspect of it." (Miklós Bóna, SIGACT News, Vol. 40 (3), 2009) "This undergraduate textbook contains three chapters: Graph Theory, Combinatorics and Infinite Combinatorics and Graphs. ... There is a short section on References in each chapter introducing briefly other books dealing with the topics covered in the respective chapter. A full list of 293 references, about 550 exercises and an index with 13 pages are also provided." (Dalibor Froncek, Zentralblatt MATH, Vol. 1170, 2009)
Dewey Edition
23
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
511.6
Synopsis
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., The second edition of this text on combinatorics and graph theory includes new material on an array topics ranging from Eulerian trails to combinatorial geometry to the pigeonhole principle. There are also numerous new exercises throughout the book., 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.
LC Classification Number
QA297.4
Item description from the seller
Popular categories from this store
Seller feedback (225,803)
This item (1)
All items (225,803)
- eBay automated feedback- Feedback left by buyer.Past monthOrder delivered on time with no issues
- eBay automated Feedback- Feedback left by buyer.Past monthOrder delivered on time with no issues
- eBay automated Feedback- Feedback left by buyer.Past monthOrder delivered on time with no issues
- eBay automated Feedback- Feedback left by buyer.Past monthOrder delivered on time with no issues
Popular categories from this store
Seller feedback (225,803)
This item (1)
All items (225,803)
- eBay automated feedback- Feedback left by buyer.Past monthOrder delivered on time with no issues
- eBay automated Feedback- Feedback left by buyer.Past monthOrder delivered on time with no issues
- eBay automated Feedback- Feedback left by buyer.Past monthOrder delivered on time with no issues
- eBay automated Feedback- Feedback left by buyer.Past monthOrder delivered on time with no issues