arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.04844math.COcs.DSmath.NT
收藏

最小k-临界二部图

Minimum k-critical bipartite graphs

Sylwia Cichacz, Karol Suchan

摘要:

本文研究了$k$-M- $(n,m)$阶的最小$k$ -临界二部图问题:寻找一个二部图$G=(U,V;E)$,其中$|U|=n$,$|V|=m$,$n>m>1$是$k$ -临界二部图,而元组$(|E|, Δ_U, Δ_V)$,其中$Δ_U$和$Δ_V$分别表示$U$和$V$中的最大度,是所有这类图的字典最小值.如果从$U$中删除最多$k=n-m$顶点会创建具有完全匹配的$G'$,则$G$是$k$ -关键二分的,即,与$m$大小匹配。我们表明,如果$m(n-m+1)/n$是一个整数,那么解决方案的M $k$ CBG- $(n,m)$的问题,可以发现之间的$(a,b)$ -定期二部图的顺序$(n,m)$,与$a=m(n-m+1)/n$,和$b=n-m+1$。若$a=m-1$,则所有阶为$(n,m)$的$(a,b)$ -正则二部图都是$k$ -临界二部图.对于$a<m-1$,情况并非如此。我们的特点$n$,$m$,$a$,$b$的值,承认一个$(a,b)$ -定期二部图的顺序$(n,m)$,与$b=n-m+1$,并给出一个简单的建设,创造这样的$k$ -关键二部图只要可能的。我们的技术是基于霍尔的婚姻定理,初等数论,线性丢番图方程,整数函数和同余的性质,以及涉及它们的方程。

英文摘要:

We study the problem of Minimum $k$-Critical Bipartite Graph of order $(n,m)$ - M$k$CBG-$(n,m)$: to find a bipartite $G=(U,V;E)$, with $|U|=n$, $|V|=m$, and $n>m>1$, which is $k$-critical bipartite, and the tuple $(|E|, Δ_U, Δ_V)$, where $Δ_U$ and $Δ_V$ denote the maximum degree in $U$ and $V$, respectively, is lexicographically minimum over all such graphs. $G$ is $k$-critical bipartite if deleting at most $k=n-m$ vertices from $U$ creates $G'$ that has a complete matching, i.e., a matching of size $m$. We show that, if $m(n-m+1)/n$ is an integer, then a solution of the M$k$CBG-$(n,m)$ problem can be found among $(a,b)$-regular bipartite graphs of order $(n,m)$, with $a=m(n-m+1)/n$, and $b=n-m+1$. If $a=m-1$, then all $(a,b)$-regular bipartite graphs of order $(n,m)$ are $k$-critical bipartite. For $a<m-1$, it is not the case. We characterize the values of $n$, $m$, $a$, and $b$ that admit an $(a,b)$-regular bipartite graph of order $(n,m)$, with $b=n-m+1$, and give a simple construction that creates such a $k$-critical bipartite graph whenever possible. Our techniques are based on Hall's marriage theorem, elementary number theory, linear Diophantine equations, properties of integer functions and congruences, and equations involving them.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑