COMBINATORICS
2002
14 years 3 months ago
2002
If G = Kn is the complete graph, the classical Pr
COMBINATORICS
2006
14 years 4 months ago
2006
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...