Ask a Question

Prefer a chat interface with context about you and your work?

On the Hamilton–Waterloo Problem with Odd Orders

On the Hamilton–Waterloo Problem with Odd Orders

Abstract Given nonnegative integers , the Hamilton–Waterloo problem asks for a factorization of the complete graph into α ‐factors and β ‐factors. Without loss of generality, we may assume that . Clearly, v odd, , , and are necessary conditions. To date results have only been found for specific values …