On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes (Q1430524): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
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.1007/s00026-003-0188-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2130401402 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:20, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes |
scientific article |
Statements
On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes (English)
0 references
27 May 2004
0 references
The following generalization of the classical Oberwolfach problem is considered: At a gathering there are \(n\) delegations with \(m\) people each. Is it possible to arrange a seating of \(nm\) people at \(s\) round tables where each table can accommodate \(t\) people (\(st=nm\)) for \(k\) different occasions such that each person has every other person not in the same delegation for a neighbor exactly \(\lambda\) times? It is proved that for \(t\geq 3,n\geq 2,\lambda\geq 2\) the solution exists precisely when \(t| mn\), \(\lambda m(n-1)\) is even, \(t\) is even when \(n=2\) and \((m,n,t,\lambda )\notin \{ (2,3,3,2j+1),(1,6,3,4j+2)\mid j\geq 0\}\). For \(\lambda =1\) the problem was solved in [\textit{J. Liu}, J. Comb. Theory, Ser. A 101, No. 1, 20--34 (2003; Zbl 1015.05074)].
0 references
resolvable cycle design
0 references
cycle frame
0 references
Hamiltonian decomposition
0 references
cycle factorization
0 references