| Budget Amount *help |
¥2,400,000 (Direct Cost: ¥2,400,000)
Fiscal Year 2005: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2004: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2003: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2002: ¥600,000 (Direct Cost: ¥600,000)
|
|---|
| Research Abstract |
Let K_n be the complete graph on n vertices. A uniform covering of the 2-paths in K_n with l-paths [l-cycles] is a set S of l-paths [l-cycles] having the property that each 2-path in K_n lies in exactly one l-path [l-cycle] in S.
When l=n, the problem of constructing a uniform covering of the 2-paths with l-paths, is the famous Dudeney's round table problem which has not been solved yet.
For a given integer l, only the following cases of the problem of constructing a uniform covering of the 2-paths in K_n with l-paths or l-cycles have been solved : with 3-cycles, with 3-paths, with 4-cycles, with 4-paths, with n-cycles (Hamilton cycles) when n is even.
In this research, we solved the problem in the case of 5-paths, 6-paths and 6-cycles, that is, we settled the necessary and sufficient conditions on existing a uniform covering of 2-paths with 5-paths, 6-paths and 6-cycles in K_n. There are no known cases where the necessary conditions on n are not sufficient for the existence of a uniform covering of 2-paths in K_n.
We also constructed an antipodal Hamilton cycle decomposition, a double Dudeney set, resolvable designs and symmetric Hamilton cycle decompositions.
|
