Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
type: Item
instance of: scholarly article
title: Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
zbMATH Open document ID: 1233.05070
author: Elizabeth J. Billington
author: Nicholas J. Cavenagh
published in: Aequationes Mathematicae
publication date: 2012-01-10T00:00:00Z
review text: \textit{E. S. Mahmoodian} and \textit{M. Mirzakhani} [Papers presented at the 25th annual Iranian mathematics conference, AIMC 25, held at Sharif University of Technology in Tehran, Iran, March 28--31, 1994. Dordrecht: Kluwer Academic Publishers. Math. Appl., Dordr. 329, 235--241 (1995; Zbl 0837.05088)] showed necessary conditions for a complete tripartite graph to be decomposed into 5-cycles. Many cases of the problem of finding necessary and sufficient conditions a complete tripartite graph to be decomposed into 5-cycles have been solved, however, the case when the partite sets have odd and distinct sizes remains open. The authors introduce a new approach by embedding previously known decompositions into larger ones. It is shown that when the partite sets are of asymptotically similar sizes, the conjectured necessary conditions for a decomposition are also sufficient. Specifically, it is shown that if \(R\), \(S\) and \(T\) are odd integers such that \(RS+ST+TR\) is divisible by 5 and \(100 < R < S < T < \kappa R\), where \(\kappa = -\frac{95}{16}+\frac{3}{16}\sqrt{1401} = 1.0806\dots\), then the complete tripartite graph having three parts of sizes \(R\), \(S\) and \(T\), has a decomposition into 5-cycles.
reviewed by: Ioan Tomescu
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5996234
zbMATH Keywords: graph decomposition
zbMATH Keywords: cycle decomposition
zbMATH Keywords: tripartite graph
MaRDI profile type: Publication
full work available at URL: s00010-011-0098-6
OpenAlex ID: W2039926741
cites work: Q4876928
cites work: Q4526648
cites work: Further decompositions of complete tripartite graphs into 5-cycles
cites work: Q4858971
DOI: 10.1007/S00010-011-0098-6
Recommended article: On decomposing complete tripartite graphs into 5-cycles
Recommended article: Q4526648
Recommended article: Further decompositions of complete tripartite graphs into 5-cycles
Recommended article: The problem of decomposing a complete tripartite graph into \(5\)-cycles
Recommended article: Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
Recommended article: Q4222083
Recommended article: Decomposing complete tripartite graphs into cycles of lengths 3 and 4
Recommended article: Decomposing complete equipartite graphs into cycles of length2p
Recommended article: Q3058999
Recommended article: 3,5-Cycle decompositions
description: scientific article; zbMATH DE number 5996234