






















This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with minimum excess is determined. Moreover, some generalisation onto minimum coverings by triples, quadruples and quintuples with minimum excess is presented.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。