| chapter 1. what is combinatorics? 1.1 example. perfect covers of chessboards 1.2 example. cutting a cube 1.3 example. magic squares 1.4 example. the 4-color problern 1.5 example. the problem of the 36 officers 1.6 example. shortest-route problem 1.7 example. the game of nim 1.8 exercises chapter 2. the pigeonhole principle 2.1 pigeonhole principle: simple form 2.2 pigeonhole principle: strong form 2.3 a theorem of ramsey 2.4 exercises chapter 3. permutations and combinations 3.1 two basic counting principles 3.2 permutations of sets 3.3 combinations of sets 3.4 permutations of multisets 3.5 combinations of multisets .3.6 exercises chapter 4. generating permutations and combinations 4.1 generating permutations 4.2 inversions in permutations 4.3 generating combinations 4.5 partial orders and equivalence relations 4.6 exercises chapter 5. the binomial coemcients 5.1 pascal's formula 5.2 the binomial theorem 5.3 identities 5.4 unimodality of binomial coemcients 5.5 the multinomial theorem 5.6 newton's binomial theorem 5.7 more on partially ordered sets 5.8 exercises chhpter 6. the inclusion-exclusion principle and applicutions 6.1 the inclusion-exclusion principle 6.2 combinations with repetition 6.3 derangements 6.4 permutations with forbidden positions 6.5 another forbidden position problem 6.6 exercises chapter 7. necurrence helations and thenerating functions 7.1 some number sequences 7.2 linear homogeneous recurrence relations 7.3 non-homogeneous recurrence relations 7.4 generating functions 7.5 recurrences and generating functions 7.6 a geometry example 7.7 exponential generating functions 7.8 exercises chnpter 8. specinl counting sequences 8.1 catalan numbers 8.2 difference sequences and stirling numbers 8.3 partition numbers 8.4 a geometric problem 8.5 exercises chapter 9. matchings in biphrtite oraphs 9.1 general problem formulation 9.2 matchings 9.3 systems of distinct representatives 9.4 stable inarriages 9.5 exercises chapter 10. combinatorial nesigns 10.1 modular arithmetic 10.2 block designs 10.3 steiner triple systems 10.4 latin squares 10.5 exercises chapter 11. introduction to orsiph theory 11.1 basic properties 11.2 eulerian trails 11.3 hamilton chains and cycles 11.4 bipartite multigraphs 11.5 trees 11.6 the shannon switching game 11.7 more on trees 11.8 exercises chapter 12. nigrhphs hnd networks 12.1 digraphs 12.2 networks 12.3 exercises chupter 13. more on oruph theory 13.1 chromatic number 13.2 plane and planar graphs 13.3 a 5-color theorem 13.4 independence number and clique number 13.5 connectivity 13.6 exercises chapter 14. polya counting 14.1 permutation and symmetry groups 14.2 burnside's theorem 14.3 polya's counting formula 14.4 exercises answers sind hints to exercises bibliography index |
内容加载中，请稍后...
商品评论（0条）