Applied Combinatorics by Alan Tucker is a good one. It's short, not hard to follow, a lot of problems to work through, and it's split into two sections: graph theory in section 1, and …

In fact,I once tried to define combinatorics in one sentence on Math Overflow this way and was vilified for omitting infinite combinatorics. I personally don't consider this kind of mathematics …

Nov 13, 2023 · So if "combinatorics is a subset of discrete mathematics" should indeed be true: I would like to see a concrete example of a subject being discrete math, but not combinatorics. I …

Is there a comprehensive resource listing binomial identities? I am more interested in combinatorial proofs of such identities, but even a list without proofs will do.

Jun 28, 2017 · This is the Binomial theorem: $$ (a+b)^n=\sum_ {k=0}^n {n\choose k}a^ {n-k}b^k.$$ I do not understand the symbol $ {n\choose k}.$ How do I actually compute this? …

Jan 11, 2016 · Combinatorics is a wide branch in Math, and a proof based on Combinatorial arguments can use many various tools, such as Bijection, Double Counting, Block Walking, et …

Oct 17, 2018 · Comically badly worded question - particularly amusing is the phrase 'each card displays one positive integer without repetition from this set' :) it's almost like the output of a …

The first basic thing to grasp is that manipulating generating functions is much easier than manipulating sequences, but the power of generating functions goes much deeper than this. …

I'm preparing myself to a combinatorics test. A part of it will concentrate on the pigeonhole principle. Thus, I need some hard to very hard problems in the subject to solve. I would be …

Aug 24, 2013 · If you want a slightly more detailed explanation and exercises I recommend the book Introduction to Combinatorics published by the United Kingdom Mathematics Trust …