Group divisible (K_4-e)-packings with any minimum leave
Combinatorics
2017-05-25 v1
Abstract
A decomposition of , the complete n-partite equipartite graph with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum group divisible packing of with G if L contains as few edges as possible. We examine all possible minimum leaves for maximum group divisible -packings. Necessary and sufficient conditions are established for their existences.
Keywords
Cite
@article{arxiv.1705.08787,
title = {Group divisible (K_4-e)-packings with any minimum leave},
author = {Y. Gao and Y. Chang and T. Feng},
journal= {arXiv preprint arXiv:1705.08787},
year = {2017}
}