Minimal transitive factorizations supported on quasi-threshold graphs
We study the number of minimal transitive factorizations of the identity permutation in $S_n$ into transpositions supported on a quasi-threshold graph. We show that this number is always divisible by $(2n-2)!/n!$, which is the factorization count for a star graph, as shown by Irving and Rattan. To prove this, we give a...