About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 146. Chapters: Factorial, Binomial coefficient, Permutation, Combination, Pigeonhole principle, Catalan's constant, Borsuk-Ulam theorem, Partition, Random permutation statistics, Longest common subsequence problem, Twelvefold way, Permanent is sharp-P-complete, Aanderaa-Karp-Rosenberg conjecture, Butcher group, Oriented matroid, Theory of relations, Permutation pattern, Bent function, Algorithmic Lovasz local lemma, Finite topological space, Enumerations of specific permutation classes, Symbolic combinatorics, Combinatorial number system, Factorial number system, Group testing, Percolation theory, Sparse ruler, Uniform convergence, History of combinatorics, Arrangement of hyperplanes, Longest increasing subsequence, Graph dynamical system, Isolation lemma, Lottery mathematics, Stable roommates problem, Trace monoid, Dividing a circle into areas, Probabilistic method, Sicherman dice, Josephus problem, 3-dimensional matching, No-three-in-line problem, Outline of combinatorics, Inversion, Domino tiling, Set packing, Combinatorics and physics, Sperner's lemma, Partition of a set, Incidence matrix, Index of combinatorics articles, Szemeredi's theorem, Umbral calculus, Natural density, Constraint counting, Multi-index notation, Barycentric-sum problem, Road coloring problem, Difference set, Stars and bars, Sidon sequence, Singmaster's conjecture, Meander, Coupon collector's problem, Rota-Baxter algebra, Combinatorial principles, Small set, Infinitary combinatorics, Laver table, Sequential dynamical system, De Arte Combinatoria, Incidence structure, Method of distinguished element, Dobinski's formula, Pascal's rule, Mnev's universality theorem, All-pairs testing, Combinatorial explosion, Composition, Free convolution, Bruck-Chowla-Ryser theorem, Topological combinatorics, Lubell-Yamamoto-Meshalkin inequality, Block...
