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

关于完全图的Biclique覆盖

On the Biclique cover of the complete graph

Farokhlagha Moazami, Nasrin Soltankhah

摘要:

设$K$是一组$k$正整数。图$G$的$K$型双团覆盖是$G$的完全二部子图的集合,使得对于$G$的每条边$e$,覆盖$e$所需的双团数是$K$的成员。如果$K=\{1,2,..., k\}$,则允许$K$型的具有$d$型的双方覆盖的完全图的最大顶点数$n(k,d)$是$\mathbb{R}^d$中$k$ -邻标准盒族的最大可能基数.本文给出了$n(k,d)$的一个上界.此外,我们还证明了在某些特殊情况下,上界是可以改进的。证明了完全二部图的$K$型双团覆盖的存在性等价于交叉$K$ -交族的存在性.

英文摘要:

Let $K$ be a set of $k$ positive integers. A biclique cover of type $K$ of a graph $G$ is a collection of complete bipartite subgraphs of $G$ such that for every edge $e$ of $G$, the number of bicliques need to cover $e$ is a member of $K$. If $K=\{1,2,..., k\}$ then the maximum number of the vertices of a complete graph that admits a biclique cover of type $K$ with $d$ bicliques, $n(k,d)$, is the maximum possible cardinality of a $k$-neighborly family of standard boxes in $\mathbb{R}^d$. In this paper, we obtain an upper bound for $n(k,d)$. Also, we show that the upper bound can be improved in some special cases. Moreover, we show that the existence of the biclique cover of type $K$ of the complete bipartite graph with a perfect matching removed is equivalent to the existence of a cross $K$-intersection family.

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

↑