






















We use Menger's Theorem and König's Line Colouring Theorem to show that in any tripartite graph with two complete (bipartite) sides the maximum number of pairwise edge-disjoint triangles equals the minimum number of edges that meet all triangles. This generalizes the corresponding result for complete tripartite graphs given by Lakshmanan, et al.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。