Bahareh Kudarzi, E. S. Mahmoodian, Zahra Naghdabadi
Published 2019-10-14Version 1
The problem of decomposing a complete tripartite graph into 5-cycles was first proposed in 1995 by Mahmoodian and Mirzakhani and since then many attempts have been made to decompose such graphs into 5-cycles. Such attempts were partially successful but parts of the problem still remain open. In this paper we review previous works and present some new results.
Some bounds on convex combinations of $ω$ and $χ$ for decompositions into many parts
On the genus of the complete tripartite graph $K_{n,n,1}$
On Decomposition of Solutions for Coalitional Games
![QR code for arXiv:1910.06385 [math.CO]](http://oss.arxitics.com/images/favicon.svg)