Almost fair perfect matchings in complete bipartite graphs

DISCRETE MATHEMATICS(2024)

引用 0|浏览0
暂无评分
摘要
Let {E-1, ..., E-m} be a partition of E(Kn,n), where Kn,n is the complete bipartite graph, and assume that |E-i|/n is an element of Z. It was conjectured in [1], that there exists a perfect matching M in K-n,K-n with s(M) = max(f) (|M boolean AND Ei|/n ) - min (i)(|M boolean AND Ei| - |Ei|/n )<= 2 . In this paper, we reprove combinatorially that this conjecture is true when m = 2 or m = 3. This result is proved in [1] by using topological methods. In the case m = 4, we prove that there is always a perfect matching M in Kn,n with s(M) <= 11. We also bring here an unpublished result from 2014 of the second author of this paper together with Irine Lo and Paul Seymour, proving that there exists a function of m alone, f (m), and a perfect matching M in Kn,n such that s(M) <= f (m). This result was later reproved by Alon in [2], where an explicit formulation of f(m) was given. (c) 2023 Elsevier B.V. All rights reserved.
更多
查看译文
关键词
Graphs matrices,Perfect-matchings,Latin -squares
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要