Colorful Subhypergraphs in Kneser Hypergraphs
Keywords:
colorful complete $p$-partite hypergraph, combinatorial topology, Kneser hypergraphs, local chromatic number
Abstract
Using a $\mathbb{Z}_q$-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of what can be the local chromatic number of a uniform hypergraph).
Published
2014-01-12
How to Cite
Meunier, F. (2014). Colorful Subhypergraphs in Kneser Hypergraphs. The Electronic Journal of Combinatorics, 21(1), P1.8. https://doi.org/10.37236/3573
Article Number
P1.8