Displaying similar documents to “Lyndon words and transition matrices between elementary, homogeneous and monomial symmetric functions.”

Decomposing complete tripartite graphs into closed trails of arbitrary lengths

Elizabeth J. Billington, Nicholas J. Cavenagh (2007)

Czechoslovak Mathematical Journal

Similarity:

The complete tripartite graph K n , n , n has 3 n 2 edges. For any collection of positive integers x 1 , x 2 , , x m with i = 1 m x i = 3 n 2 and x i 3 for 1 i m , we exhibit an edge-disjoint decomposition of K n , n , n into closed trails (circuits) of lengths x 1 , x 2 , , x m .