On Alspach's conjecture with two even cycle lengths (Q1587593): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Peter J. Adams / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Abdollah Khodkar / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Alexander Rosa / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00051-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2004272279 / rank | |||
Normal rank |
Latest revision as of 10:47, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Alspach's conjecture with two even cycle lengths |
scientific article |
Statements
On Alspach's conjecture with two even cycle lengths (English)
0 references
27 January 2002
0 references
Alspach's conjecture states that if \(\pi\) is a partition of the number \(v(v-1)/2\), for \(v\) odd [of the number \(v(v-2)/2\), for \(v\) even] into \(s\) parts, each at least 3 and at most \(v\), then there exists a decomposition of the complete graph \(K_v\) [of the cocktail-party graph \(K_v-F\)] into \(s\) cycles whose lengths equal the parts of the partition \(\pi\). In this paper, the authors deal with the case when all parts are equal to one of two even numbers \(m\), \(n\), \(m< n\). They show that in this case Alspach's conjecture is true if and only if it is true for all \(v< 7n\). This, together with settling several small cases, makes it possible to show that the Alspach conjecture is true for all even \(m\), \(n\leq 10\).
0 references
Alspach's conjecture
0 references
decomposition
0 references
cycles
0 references