Colorful subhypergraphs in Kneser hypergraphs (Q405073)

Summary: Using a \(\mathbb{Z}_q\)-generalization of a theorem of \textit{K. Fan} [Ann. Math. (2) 56, 431--437 (1952; Zbl 0047.42004)], 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).