arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1607.01003math.COmath.AT
收藏

有限集与凸集的交模式

Intersection patterns of finite sets and of convex sets

Florian Frick

摘要:

主要结果是r-一致超图色数下界的结果和Tverberg型理论中的一些主要定理的一般推广,这些定理涉及单纯复形连续映射到欧几里得空间时的面相交模式.作为一个应用,我们得到了一个简单的证明推广的结果Kriz某些参数。本文专门给出了Kneser猜想的一个简短的证明。此外,结合这一结果与最近的工作Mabillard和Wagner,我们表明,某些等变映射的存在性产生下界的色数。对Schrijver关于稳定Kneser图的色数的结果给出了一个本质上初等的证明.事实上,我们证明了每个相邻的偶数维多面体产生一个小的诱导子图的Kneser图相同的色数。利用这个几何观点,我们进一步给出了Kneser超图的某些小子超图的色数的紧下界。

英文摘要:

The main result is a common generalization of results on lower bounds for the chromatic number of r-uniform hypergraphs and some of the major theorems in Tverberg-type theory, which is concerned with the intersection pattern of faces in a simplicial complex when continuously mapped to Euclidean space. As an application we get a simple proof of a generalization of a result of Kriz for certain parameters. This specializes to a short and simple proof of Kneser's conjecture. Moreover, combining this result with recent work of Mabillard and Wagner we show that the existence of certain equivariant maps yields lower bounds for chromatic numbers. We obtain an essentially elementary proof of the result of Schrijver on the chromatic number of stable Kneser graphs. In fact, we show that every neighborly even-dimensional polytope yields a small induced subgraph of the Kneser graph of the same chromatic number. We furthermore use this geometric viewpoint to give tight lower bounds for the chromatic number of certain small subhypergraphs of Kneser hypergraphs.

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

↑