Equipartite and almost-equipartite gregarious 4-cycle systems (Q2470435): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Decomposition of complete tripartite graphs into gregarious 4-cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decompositions of complete multipartite graphs into cycles of even length / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4876932 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k / rank | |||
Normal rank |
Latest revision as of 16:54, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equipartite and almost-equipartite gregarious 4-cycle systems |
scientific article |
Statements
Equipartite and almost-equipartite gregarious 4-cycle systems (English)
0 references
14 February 2008
0 references
A \(4\)-cycle decomposition of a complete multipartite graph is gregarious if each \(4\)-cycle in the decomposition has its vertices in different partite sets. It is proved that there is a gregarious \(4\)-cycle decomposition of the complete multipartite graph \(K_{n(m)}\) having \(n\) parts of size \(m\) if and only if \(n \geq 4\) and (i) \(m\) is even, or (ii) \(m\) is odd and \(n \equiv 1\) mod \(8\). It is also shown that if \(a\) and \(b\) are even, a gregarious \(4\)-cycle decomposition exists for \(K_{n(a), b}\), a complete multipartite graph with \(n\) parts of size \(a\) and one of size \(b\), if and only if \(n \geq 4\) and \(b \leq \lfloor a(n-1)/2 \rfloor\), or \(n = 3\) and \(a = b\). Partial results are obtained when \(a\) and \(b\) are both odd.
0 references
4-cycles
0 references
multipartite graphs, decompositions, gregarious cycles
0 references