首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Colorful subgraphs in Kneser-like graphs
Authors:Gbor Simonyi  Gbor Tardos
Institution:aAlfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, 1364 Budapest, POB 127, Hungary;bSchool of Computing Science, Simon Fraser University, Burnaby BC, Canada V5A 1S6
Abstract:Combining Ky Fan’s theorem with ideas of Greene and Matoušek we prove a generalization of Dol’nikov’s theorem. Using another variant of the Borsuk–Ulam theorem due to Tucker and Bacon, we also prove the presence of all possible completely multicolored t-vertex complete bipartite graphs in t-colored t-chromatic Kneser graphs and in several of their relatives. In particular, this implies a generalization of a recent result of G. Spencer and F.E. Su.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号