Colorful subgraphs in Kneser-like graphs
Gábor Simonyi, Gábor Tardos
Abstract
Combining Ky Fan's theorem with ideas of Greene and Matousek we prove a generalization of Dol'nikov's theorem. Using another variant of the Borsuk-Ulam theorem due to Bacon and Tucker, 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.
Create a lesson
Related papers
Maximal anti-Ramsey problems for posets
Binlong Li, Balázs Patkós, Changxin Wang
An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision
Douglas M. Chen
Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization
Shixin Wang
An Improvement to the Upper Bound for Marton's Covering Conjecture
Zhao Song, Song Yue
Vertex-transitive strongly regular graphs in the switching class of doubly transitive two-graphs
Robert F. Bailey, Gábor P. Nagy, Valentino Smaldore
Inversion-descent enumerators of 321-avoiding permutations
Qiongqiong Pan