Colorful Subhypergraphs in Uniform Hypergraphs
Abstract
There are several topological results ensuring the existence of a large complete bipartite subgraph in any properly colored graph satisfying some special topological regularity conditions. In view of -Tucker lemma, Alishahi and Hajiabolhassan [{\it On the chromatic number of general Kneser hypergraphs, Journal of Combinatorial Theory, Series B, 2015}] introduced a lower bound for the chromatic number of Kneser hypergraphs . Next, Meunier [{\it Colorful subhypergraphs in Kneser hypergraphs, The Electronic Journal of Combinatorics, 2014}] improved their result by proving that any properly colored general Kneser hypergraph contains a large colorful -partite subhypergraph provided that is prime. In this paper, we give some new generalizations of -Tucker lemma. Hence, improving Meunier's result in some aspects. Some new lower bounds for the chromatic number and local chromatic number of uniform hypergraphs are presented as well.
Cite
@article{arxiv.1605.06701,
title = {Colorful Subhypergraphs in Uniform Hypergraphs},
author = {Meysam Alishahi},
journal= {arXiv preprint arXiv:1605.06701},
year = {2016}
}
Comments
18 pages