Graph Polynomial for Colored Embedded Graphs: A Topological Approach
Indian Institute of Science Education & Research, Mohanpur(印度科学教育研究所莫汉布尔分校);Indian Institute of Science Education and Research Pune(印度科学教育研究所浦那分校);TCG CREST
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.
证明了一个“Tverberg型”多重交定理。它通过添加颜色约束,加强了1966年的原始Tverberg定理的素数情况,以及Barany et al.(1980)的拓扑Tverberg定理。它也为Barany & Larman(1992)的(拓扑)有色Tverberg问题提供了一个改进的界,该界在素数情形下是紧的,在一般情形下是渐近最优的。证明是基于相对等变阻塞理论。
Strengthening topological colorful results for graphs
当适当有色图的色数的拓扑下界满足一定条件时,各种结果都保证了大的完全二部图的存在性。我们推广了三个这类定理,分别来自Simonyi和Tardos(Combinatorica,2006),Simonyi,Tardif和Zsbán(The Electronic Journal of Combinatorics,2013)和Chen(Journal of Combinatorial Theory,Series A,2011)。作为Chen定理的推广,我们得到了一类新的图族,它们的色数等于它们的圆色数,并且满足Hedetniemi关于圆色数的猜想.