Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654851 | European Journal of Combinatorics | 2007 | 13 Pages |
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 tt-vertex complete bipartite graphs in tt-colored tt-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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gábor Simonyi, Gábor Tardos,