| 000 | 02022nam a2200349 4500 | ||
|---|---|---|---|
| 001 | OTLid0000494 | ||
| 003 | MnU | ||
| 005 | 20201105133334.0 | ||
| 006 | m o d s | ||
| 008 | 180907s2017 mnu o 0 0 eng d | ||
| 020 | _a | ||
| 040 |
_aMnU _beng _cMnU |
||
| 050 | 4 | _aQA76 | |
| 100 | 1 |
_aMorris, Joy _eauthor |
|
| 245 | 0 | 0 |
_aCombinatorics _cJoy Morris |
| 264 | 2 | _bOpen Textbook Library | |
| 264 | 1 | _bJoy Morris | |
| 300 | _a1 online resource | ||
| 490 | 0 | _aOpen textbook library. | |
| 505 | 0 | _aChapter 1. What is Combinatorics? -- Part I. Enumeration -- Chapter 2. Basic Counting Techniques -- Chapter 3. Permutations, Combinations, and the Binomial Theorem -- Chapter 4. Bijections and Combinatorial Proofs -- Chapter 5. Counting with Repetitions -- Chapter 6. Induction and Recursion -- Chapter 7. Generating Functions -- Chapter 8. Generating Functions and Recursion -- Chapter 9. Some Important Recursively-Defined Sequences -- Chapter 10. Other Basic Counting Techniques -- Part II. Graph Theory -- Chapter 11. Basics of Graph Theory -- Chapter 12. Moving through graphs -- Chapter 13. Euler and Hamilton -- Chapter 14. Graph Colouring -- Chapter 15. Planar graphs -- Part III. Design Theory -- Chapter 16. Latin squares -- Chapter 17. Designs -- Chapter 18. More designs -- Chapter 19. Designs and Codes -- IndexList of NotationAppendix A. Solutions to selected exercises | |
| 520 | 0 | _aCombinatorics is an upper-level introductory course in enumeration, graph theory, and design theory. | |
| 542 | 1 | _fAttribution-NonCommercial-ShareAlike | |
| 546 | _aIn English. | ||
| 588 | 0 | _aDescription based on online resource | |
| 650 | 0 |
_aComputer Science _vTextbooks |
|
| 710 | 2 |
_aOpen Textbook Library _edistributor |
|
| 856 | 4 | 0 |
_uhttps://open.umn.edu/opentextbooks/textbooks/494 _zAccess online version |
| 999 |
_c19877 _d19877 |
||