On Alspach's conjecture (Q911616): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56688016, #quickstatements; #temporary_batch_1707252663060 |
Removed claims |
||
Property / author | |||
Property / author: Katherine Heinrich / rank | |||
Property / author | |||
Property / author: Peter Horák / rank | |||
Property / reviewed by | |||
Property / reviewed by: Štefan Znám / rank | |||
Revision as of 14:49, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Alspach's conjecture |
scientific article |
Statements
On Alspach's conjecture (English)
0 references
1989
0 references
B. Alspach asked the following question. If n is odd (even) and \(a_ 1+a_ 2+...+a_ m=n(n-1)/2,\) \((n(n-2)/2),\) \(3\leq a_ i\leq n,\) can be edges of \(K_ n\) \((K_ n-F\), F is a 1-factor) be partitioned into m cycles \(C_{a_ 1},C_{a_ 2},...,C_{a_ m}?\) The present paper gives an affirmative answer to this question in cases (i) \(a_ i\in \{n-2,n-1,n\}\), \(1\leq i\leq m,\) (ii) \(a_ i\in \{3,4,6\}\), \(1\leq i\leq m,\) (iii) \(a_ i\in \{2^ k,2^{k+1}\}\), \(k\geq 2.\) A misprint: In the second row of page 1 we have to have \(a_ 1+a_ 2\) instead of \(a_ 1a_ 2\).
0 references
edge partition
0 references