English

Colorful Subhypergraphs in Uniform Hypergraphs

Combinatorics 2016-07-05 v2

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 Zp\mathbb{Z}_p-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 KGr(H){\rm KG}^r({\mathcal H}). 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 KGr(H){\rm KG}^r({\mathcal H}) contains a large colorful rr-partite subhypergraph provided that rr is prime. In this paper, we give some new generalizations of Zp\mathbb{Z}_p-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.

Keywords

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

R2 v1 2026-06-22T14:06:29.240Z