arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.0766math.CO
收藏

下匹配猜想及Schrijver和Gurvits定理的新证明

Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems

Péter Csikvári

摘要:

Friedland的下匹配猜想断言,如果$G$是$v(G)=2n$-正则二部图,且$m_k(G)$表示$k$大小的匹配数,则有$$m_k(G)\geq {n \choose k}^2\left(\frac{d-p}{d}\right)^{n(d-p)}(dp)^{np},$$,其中$p=\frac{k}{n}$ .当$p=1$,这个猜想减少到Schrijver定理说,$d$-正则二部图的$v(G)=2n$顶点至少有$$\left(\frac{(d-1)^{d-1}}{d^{d-2}}\right)^n$$完美匹配。L. Gurvits证明了下匹配猜想的一个渐近版本,即他证明了$$\frac{\ln m_k(G)}{v(G)}\geq \frac{1}{2}\left(p\ln \left(\frac{d}{p}\right)+(d-p)\ln \left(1-\frac{p}{d}\right)-2(1-p)\ln (1-p)\right)+o_{v(G)}(1).$$在本文中,我们证明了下匹配猜想。事实上,我们将证明一个稍微更强的陈述,它给出了一个额外的$c_p\sqrt{n}$因子相比,如果$p$是分开的$0$和$1$的猜想,并紧到一个常数因子,如果$p$是分开的$1$。我们还将给出Gurvits和Schrijver定理的一个新的证明,并将这些定理推广到$(a,b)$ --双正则二部图。

英文摘要:

Friedland's Lower Matching Conjecture asserts that if $G$ is a $d$--regular bipartite graph on $v(G)=2n$ vertices, and $m_k(G)$ denotes the number of matchings of size $k$, then $$m_k(G)\geq {n \choose k}^2\left(\frac{d-p}{d}\right)^{n(d-p)}(dp)^{np},$$ where $p=\frac{k}{n}$. When $p=1$, this conjecture reduces to a theorem of Schrijver which says that a $d$--regular bipartite graph on $v(G)=2n$ vertices has at least $$\left(\frac{(d-1)^{d-1}}{d^{d-2}}\right)^n$$ perfect matchings. L. Gurvits proved an asymptotic version of the Lower Matching Conjecture, namely he proved that $$\frac{\ln m_k(G)}{v(G)}\geq \frac{1}{2}\left(p\ln \left(\frac{d}{p}\right)+(d-p)\ln \left(1-\frac{p}{d}\right)-2(1-p)\ln (1-p)\right)+o_{v(G)}(1).$$ In this paper, we prove the Lower Matching Conjecture. In fact, we will prove a slightly stronger statement which gives an extra $c_p\sqrt{n}$ factor compared to the conjecture if $p$ is separated away from $0$ and $1$, and is tight up to a constant factor if $p$ is separated away from $1$. We will also give a new proof of Gurvits's and Schrijver's theorems, and we extend these theorems to $(a,b)$--biregular bipartite graphs.

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

↑