arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.0681math.COcs.DM
收藏

几乎正则图中的最大匹配

On maximum matchings in almost regular graphs

Petros A. Petrosyan

摘要:

在2010年,Mkrtchyan,Petrosyan和Vardanyan证明了每个具有$2\leq δ(G)\leq Δ(G)\leq 3$的图$G$包含一个最大匹配,其不饱和顶点没有公共邻居,其中$Δ(G)$和$δ(G)$分别表示$G$中顶点的最大和最小度。在同一篇论文中,他们提出了以下猜想:每一个图$G$与$Δ(G)-δ(G)\leq 1$包含一个最大匹配,其不饱和顶点没有一个共同的邻居。最近,Picouleau用$Δ(G)=5$和$δ(G)=4$构造了一个二分反例$G$,从而证明了这个猜想是错误的。本文证明了对于图$G$,当$Δ(G)-δ(G)=1$和$Δ(G)\geq 4$满足时,该猜想是错误的;对于$r$ -正则图,当$r\geq 7$满足时,该猜想是错误的.

英文摘要:

In 2010, Mkrtchyan, Petrosyan and Vardanyan proved that every graph $G$ with $2\leq δ(G)\leq Δ(G)\leq 3$ contains a maximum matching whose unsaturated vertices do not have a common neighbor, where $Δ(G)$ and $δ(G)$ denote the maximum and minimum degrees of vertices in $G$, respectively. In the same paper they suggested the following conjecture: every graph $G$ with $Δ(G)-δ(G)\leq 1$ contains a maximum matching whose unsaturated vertices do not have a common neighbor. Recently, Picouleau disproved this conjecture by constructing a bipartite counterexample $G$ with $Δ(G)=5$ and $δ(G)=4$. In this note we show that the conjecture is false for graphs $G$ with $Δ(G)-δ(G)=1$ and $Δ(G)\geq 4$, and for $r$-regular graphs when $r\geq 7$.

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

↑