Due to the famous Gale-Shapley Theorem we know that each classical marriage problem admits at least one stable matching. This fact inspired researchers to search for the maximum number of possible stable matchings, which is equivalent to find the minimum number of unstable matchings, among all...