Simple Minimum(K_4-e)-coverings of Complete Multipartite Graphs

作     者：Yu Feng GAO Yan Xun CHANG Tao FENG 

作者机构：Institute of Mathematics Beijing Jiaotong University College of Mathematics Tonghua Normal University 

出 版 物：《Acta Mathematica Sinica,English Series》 (数学学报（英文版）)

年 卷 期：2019年第35卷第5期

页      面：632-648页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：Supported by NSFC(Grant Nos.11431003 and 11471032) Fundamental Research Funds for the Central Universities(Grant Nos.2016JBM071 and 2016JBZ012) 

主　　题：Group divisible covering (K4-e)-covering excess graph 

摘      要：A decomposition of K_(n(g))∪Γ, the complete n-partite equipartite graph over gn vertices union a graph Γ(called the excess) that is a subgraph of K_(n(g)), into edge disjoint copies of a graph G is called a simple minimum group divisible covering of type g^n with G if Γ contains as few edges as possible. We examine all possible excesses for simple minimum group divisible(K_4-e)-*** and sufficient conditions are established for their existence.