书目名称 | Combinatorics and Graph Theory | 编辑 | John Harris,Jeffry L. Hirst,Michael Mossinghoff | 视频video | | 概述 | Includes useful pointers to further reading at the post-graduate level.Definitions are followed by representative examples.contains numerous exercises, figures, and exposition.More streamlined than mo | 丛书名称 | Undergraduate Texts in Mathematics | 图书封面 |  | 描述 | 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 | 出版日期 | Textbook 2008Latest edition | 关键词 | Addition; Combinatorics; Counting; Graph; Graph Theory; Hamiltonian path; pigeonhole principle | 版次 | 2 | doi | https://doi.org/10.1007/978-0-387-79711-3 | isbn_softcover | 978-1-4419-2723-1 | isbn_ebook | 978-0-387-79711-3Series ISSN 0172-6056 Series E-ISSN 2197-5604 | issn_series | 0172-6056 | copyright | Springer-Verlag New York 2008 |
The information of publication is updating
|
|