query: Reference request for Combinatorics problems
positive_passages.docid: 39872
positive_passages.text: Good Book On Combinatorics
negative_passages.docid: 59831
negative_passages.text: How to relate combinatorial proof to bipartite graphs?
negative_passages.docid: 5801
negative_passages.text: Combinatorial proof help
negative_passages.docid: 39382
negative_passages.text: Examples of the Pigeonhole Principle
negative_passages.docid: 25283
negative_passages.text: Intermediate Text in Combinatorics?
negative_passages.docid: 8049
negative_passages.text: Generating Combinations
negative_passages.docid: 13860
negative_passages.text: IMO/1981 - Combinatorics
negative_passages.docid: 3786
negative_passages.text: Help finding a combinatorial proof of $k {n \choose k } = n {n - 1 \choose k -1}\;$
negative_passages.docid: 9971
negative_passages.text: enumerative combinatorics,In how many ways (as a function of n) can one choose a composition α α of n
negative_passages.docid: 20221
negative_passages.text: Combinatorics - Removing Double Counted Cases
negative_passages.docid: 57986
negative_passages.text: Sum of products of combinatorials
negative_passages.docid: 150281
negative_passages.text: Am I on the right track to figure out this combinatorics problem?
negative_passages.docid: 62175
negative_passages.text: A general formula for $n$ distinguishable arrangements of length $\ell$ of a sequence of a given size?
negative_passages.docid: 123407
negative_passages.text: Combinatorics - binary - very interesting question
negative_passages.docid: 24212
negative_passages.text: proving how many permutations exist.
negative_passages.docid: 17580
negative_passages.text: Combinatorics That Looks Similar to Vandermonde's Identity
negative_passages.docid: 8149
negative_passages.text: Algorithm to return all combinations of k elements from n