Cube factorizations of complete graphs

被引：10
|
作者：
Adams, P [1 ]
Bryant, D [1 ]
Maenhaut, B [1 ]
机构：
[1] Univ Queensland, Dept Math, Brisbane, Qld 4072, Australia
来源：
JOURNAL OF COMBINATORIAL DESIGNS | 2004年 / 12卷 / 05期
关键词：
factorization; cube decomposition; uniform; 3-factorization;
D O I：
10.1002/jcd.20015
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 16 (mod 24), thus providing a new family of uniform 3 -factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. (C) 2004 Wiley Periodicals, Inc.
引用
收藏
页码：381 / 388
页数：8
相关论文
共 50 条
12345