摘要
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)-coverings.Necessary and sufficient conditions are established for their existence.
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)-coverings.Necessary and sufficient conditions are established for their existence.
基金
Supported by NSFC(Grant Nos.11431003 and 11471032)
Fundamental Research Funds for the Central Universities(Grant Nos.2016JBM071 and 2016JBZ012)
