Show simple item record  

dc.contributor.authorBillington, Elizabeth J.
dc.contributor.authorCavenagh, Nicholas J.
dc.date.accessioned2012-01-31T02:01:23Z
dc.date.available2012-01-31T02:01:23Z
dc.date.issued2011
dc.identifier.citationBillington, E.J., Cavenagh, N.J. (2011). Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size. Aequationes Mathematicae, 82(3), 277-289.en_NZ
dc.identifier.urihttps://hdl.handle.net/10289/5992
dc.description.abstractThe problem of finding necessary and sufficient conditions to decompose a complete tripartite graph into 5-cycles was first posed at a conference in 1994 (Mahmoodian and Mirzakhani in Combinatorics Advances, 1995). Since then, many cases of the problem have been solved by various authors; however the case when the partite sets have odd and distinct sizes remains open. In this note, we introduce a new approach to the problem by embedding previously known decompositions into larger ones. Via this approach, we show that when the partite sets have asymptotically similar sizes, the conjectured necessary conditions for a decomposition are also sufficient.en_NZ
dc.language.isoen
dc.publisherSpringeren_NZ
dc.relation.urihttp://www.springerlink.com/content/g27vxk3871171584/en_NZ
dc.subjectgraph decompositionen_NZ
dc.subjectcycle decompositionen_NZ
dc.subjectcomplete tripartite graphen_NZ
dc.titleDecomposing complete tripartite graphs into 5-cycles when the partite sets have similar sizeen_NZ
dc.typeJournal Articleen_NZ
dc.identifier.doi10.1007/s00010-011-0098-6en_NZ
dc.relation.isPartOfAequationes Mathematicaeen_NZ
pubs.begin-page277en_NZ
pubs.elements-id36812
pubs.end-page289en_NZ
pubs.issue3en_NZ
pubs.volume82en_NZ


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record