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

直积上匹配与彩虹匹配的极值问题

Extremal Problem for Matchings and Rainbow Matchings on Direct Products

Jian Wang, Jie You

摘要:

令$n_1,\dots,n_\ell,k_1,\dots,k_\ell$为整数,令$V_1,\dots,V_\ell$为$i=1,\dots,\ell$的与$|V_i|=n_i$不相交的集合。将$\sqcup_{i=1}^\ell \binom{V_i}{k_i}$定义为$\cup_{i=1}^\ell V_i$的所有子集$F$与每个$i=1,\dots,\ell$的$|F\cap V_i| =k_i$的集合。本文证明了:对于所有的$i$,若$\mathcal{F}\subseteq \sqcup_{i=1}^\ell \binom{V_i}{k_i}$的匹配数至多为$s$和$n_i\geq 4\ell^2 k_i^2s$,则$|\mathcal{F}| \leq \max_{1\leq i\leq \ell}[\binom{n_i}{k_i}-\binom{n_i-s}{k_i}]\prod_{j\neq i}\binom{n_j}{k_j}$ .设$\mathcal{F}_1,\mathcal{F}_2,\dots,\mathcal{F}_s\subseteq\sqcup_{i=1}^\ell \binom{V_i}{k_i}$与$n_i\geq 8\ell^2k_i^2s$对所有$i$。我们还证明了如果$\mathcal{F}_1,\mathcal{F}_2,\dots,\mathcal{F}_s$是彩虹匹配自由的,则在$[s]$中存在$t$,使得$|\mathcal{F}_t|\leq \max_{1\leq i\leq \ell}\left[\binom{n_i}{k_i}-\binom{n_i-s+1}{k_i}\right]\prod_{j\neq i}\binom{n_j}{k_j}.$

英文摘要:

Let $n_1,\dots,n_\ell,k_1,\dots,k_\ell$ be integers and let $V_1,\dots,V_\ell$ be disjoint sets with $|V_i|=n_i$ for $i=1,\dots,\ell$. Define $\sqcup_{i=1}^\ell \binom{V_i}{k_i}$ as the collection of all subsets $F$ of $\cup_{i=1}^\ell V_i$ with $|F\cap V_i| =k_i$ for each $i=1,\dots,\ell$. In this paper, we show that if the matching number of $\mathcal{F}\subseteq \sqcup_{i=1}^\ell \binom{V_i}{k_i}$ is at most $s$ and $n_i\geq 4\ell^2 k_i^2s$ for all $i$, then $|\mathcal{F}| \leq \max_{1\leq i\leq \ell}[\binom{n_i}{k_i}-\binom{n_i-s}{k_i}]\prod_{j\neq i}\binom{n_j}{k_j}$. Let $\mathcal{F}_1,\mathcal{F}_2,\dots,\mathcal{F}_s\subseteq\sqcup_{i=1}^\ell \binom{V_i}{k_i}$ with $n_i\geq 8\ell^2k_i^2s$ for all $i$. We also prove that if $\mathcal{F}_1,\mathcal{F}_2,\dots,\mathcal{F}_s$ are rainbow matching free, then there exists $t$ in $[s]$ such that $|\mathcal{F}_t|\leq \max_{1\leq i\leq \ell}\left[\binom{n_i}{k_i}-\binom{n_i-s+1}{k_i}\right]\prod_{j\neq i}\binom{n_j}{k_j}.$

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

↑