Colorful subhypergraphs in uniform hypergraphs (Q510336): Difference between revisions

Summary: There are several topological results ensuring in any properly colored~graph the existence of a colorful complete bipartite subgraph, whose order is bounded from below by some topological invariants of some topological spaces associated to the graph. \textit{F. Meunier} [Electron. J. Comb. 21, No. 1, Research Paper P1.8, 13 p. (2014; Zbl 1300.05202)] presented the first colorful type result for uniform hypergraphs. In this paper, we give some new generalizations of the \(\mathbb{Z}_p\)-Tucker lemma and by use of them, we improve Meunier's result and some other colorful results by \textit{G. Simonyi} et al. [Electron. J. Comb. 20, No. 1, Research Paper P10, 15 p. (2013; Zbl 1266.05041)] and by \textit{G. Simonyi} and \textit{G. Tardos} [Eur. J. Comb. 28, No. 8, 2188--2200 (2007; Zbl 1125.05042)] to uniform hypergraphs. Also, we introduce some new lower bounds for the chromatic number and local chromatic number of uniform hypergraphs. A hierarchy between these lower bounds is presented as well.