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

并闭集猜想几乎对所有随机二部图都成立

The union-closed sets conjecture almost holds for almost all random bipartite graphs

Henning Bruhn, Oliver Schaudt

摘要:

弗兰克尔的并闭集猜想指出,在每一个集合的有限并闭集中,有一个元素包含在至少一半的成员集中(假设至少有两个成员)。这个猜想在图的方面有一个等价的公式:在每个至少有一条边的二部图中,两个色类都包含一个至多属于一半的最大稳定集的顶点。证明了对任意固定的边概率,几乎任意的随机二部图几乎满足Frankl猜想。

英文摘要:

Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an equivalent formulation in terms of graphs: In every bipartite graph with least one edge, both colour classes contain a vertex belonging to at most half of the maximal stable sets. We prove that, for every fixed edge-probability, almost every random bipartite graph almost satisfies Frankl's conjecture.

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

↑