|
|
Sold Out
Book Categories |
| Preface | ||
| 1 | An Introduction to Enumeration | |
| Sect. 1 | Elementary Counting Principles | 1 |
| Sect. 2 | Functions and the Pigeonhole Principle | 14 |
| Sect. 3 | Subsets | 27 |
| Sect. 4 | Using Binomial Coefficients | 40 |
| Sect. 5 | Mathematical Induction | 54 |
| 2 | Equivalence Relations, Partitions, and Multisets | |
| Sect. 1 | Equivalence Relations | 69 |
| Sect. 2 | Distributions and Multisets | 83 |
| Sect. 3 | Partitions and Stirling Numbers | 99 |
| Sect. 4 | Partitions of Integers | 110 |
| 3 | Algebraic Counting Techniques | |
| Sect. 1 | The Principle of Inclusion and Exclusion | 119 |
| Sect. 2 | The Concept of a Generating Function | 138 |
| Sect. 3 | Applications to Partitions and Inclusion-Exclusion | 154 |
| Sect. 4 | Recurrence Relations and Generating Functions | 169 |
| Sect. 5 | Exponential Generating Functions | 184 |
| 4 | Graph Theory | |
| Sect. 1 | Eulerian Walks and the Idea of Graphs | 200 |
| Sect. 2 | Trees | 211 |
| Sect. 3 | Shortest Paths and Search Trees | 226 |
| Sect. 4 | Isomorphism and Planarity | 242 |
| Sect. 5 | Digraphs | 252 |
| Sect. 6 | Coloring | 263 |
| Sect. 7 | Graphs and Matrices | 277 |
| 5 | Matching and Optimization | |
| Sect. 1 | Matching Theory | 291 |
| Sect. 2 | The Greedy Algorithm | 314 |
| Sect. 3 | Network Flows | 328 |
| Sect. 4 | Flows, Connectivity, and Matching | 345 |
| 6 | Combinatorial Designs | |
| Sect. 1 | Latin Squares and Graeco-Latin Squares | 359 |
| Sect. 2 | Block Designs | 379 |
| Sect. 3 | Construction and Resolvability of Designs | 391 |
| Sect. 4 | Affine and Projective Planes | 409 |
| Sect. 5 | Codes and Designs | 424 |
| 7 | Ordered Sets | |
| Sect. 1 | Partial Orderings | 442 |
| Sect. 2 | Linear Extensions and Chains | 458 |
| Sect. 3 | Lattices | 477 |
| Sect. 4 | Boolean Algebras | 488 |
| Sect. 5 | Mobius Functions | 505 |
| Sect. 6 | Products of Orderings | 523 |
| 8 | Enumeration under Group Action | |
| Sect. 1 | Permutation Groups | 532 |
| Sect. 2 | Groups Acting on Sets | 545 |
| Sect. 3 | Polya's Enumeration Theorem | 562 |
| Answers to Exercises | 581 | |
| Index | 642 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Raymond Saliga
reviewed Introductory Combinatorics on January 01, 2020
Introductory Combinatorics
An exceptional textbook for computer science. This is not among the very popular titles on the subject, but one of the best.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Introductory Combinatorics
X
This Item is in Your Inventory
Introductory Combinatorics
X
You must be logged in to review the productsX
X
X
Add Introductory Combinatorics, Focusing on the core material of value to students in a wide variety of fields, this book presents a broad comprehensive survey of modern combinatorics at an introductory level. The author begins with an introduction of concepts fundamental to all branche, Introductory Combinatorics to the inventory that you are selling on WonderClubX
X
Add Introductory Combinatorics, Focusing on the core material of value to students in a wide variety of fields, this book presents a broad comprehensive survey of modern combinatorics at an introductory level. The author begins with an introduction of concepts fundamental to all branche, Introductory Combinatorics to your collection on WonderClub |