Complete bipartite factorisations by complete bipartite graphs

被引：26

作者：

Martin, N ^{[1
]}

机构：

[1] UNIV DURHAM, DEPT MATH SCI, SCI LABS, DURHAM DH1 3LE, ENGLAND

来源：

DISCRETE MATHEMATICS | 1997年 / 167卷

关键词：

D O I：

10.1016/S0012-365X(97)00248-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We study complete K-p,K-q-factorisations of K-m,K-n. Simple necessary conditions are found and we conjecture that these conditions are also sufficient. A general construction is given to find infinite families of factorisations proving the conjecture in many cases. The conjecture is proved for K-1,K-q-factorisations of K-n,K-n except for q = 4k + 1. The conjecture is also proved for a further family of K-1,K-3-factorisations.

引用

页码：461 / 480

页数：20