| 000 | 02450nam a22002417a 4500 | ||
|---|---|---|---|
| 005 | 20230920131443.0 | ||
| 008 | 230920b |||||||| |||| 00| 0 eng d | ||
| 020 | _a9780000987648 | ||
| 028 |
_a: Technical Bureau _b: E/261, Shastri Nagar, Delhi. _c:TB1685 _d: 14/09/2023 |
||
| 082 | _a511.6 BON | ||
| 100 | _aBona, Miklos. | ||
| 100 | _a; Stanley, Richard P. | ||
| 245 |
_aA walk through combinatorics _b : an introduction to enumeration and graph theory. _c/Miklos Bona, |
||
| 260 |
_a, New Jersey _b: World Scientific _c, 2017. |
||
| 300 |
_axx, 593 pages _b: illustrations _c ; 24 cm. |
||
| 365 | _b1595 | ||
| 520 | _aThis is a textbook for an introductory combinatorics course lasting one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course.Just as with the first three editions, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible to the talented and hardworking undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings, Eulerian and Hamiltonian cycles, and planar graphs.New to this edition are the Quick Check exercises at the end of each section. In all, the new edition contains about 240 new exercises. Extra examples were added to some sections where readers asked for them.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs, enumeration under group action, generating functions of labeled and unlabeled structures and algorithms and complexity.The book encourages students to learn more combinatorics, provides them with a not only useful but also enjoyable and engaging reading. | ||
| 650 | _aCombinatorial analysis | ||
| 650 | _aGraph theory | ||
| 650 | _aCombinatorial enumeration problems | ||
| 700 | _aMiklos Bona | ||
| 942 | _cBOOK | ||
| 999 |
_c60859 _d60859 |
||