共查询到20条相似文献,搜索用时 303 毫秒
1.
2.
4.
5.
6.
7.
9.
11.
12.
13.
14.
16.
17.
19.
In Korchmáros et al. (2018)one-factorizations of the complete graph are constructed for with any odd prime power such that either or . The arithmetic restriction is due to the fact that the vertices of in the construction are the points of a conic in the finite plane of order . Here we work on the Euclidean plane and describe an analogous construction where the role of is taken by a regular -gon. This allows us to remove the above constraints and construct one-factorizations of for every even . 相似文献