pith. sign in

arxiv: math/0512019 · v1 · submitted 2005-12-01 · 🧮 math.CO · math.AT

Colorful subgraphs in Kneser-like graphs

classification 🧮 math.CO math.AT
keywords graphstheoremgeneralizationproveanotherbaconbipartiteborsuk-ulam
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.