
doi: 10.37236/3573
arXiv: 1306.1112
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).
combinatorial topology, Coloring of graphs and hypergraphs, colorful complete \(p\)-partite hypergraph, local chromatic number, Mathematics - Combinatorics, Hypergraphs, Kneser hypergraphs, 05C65
combinatorial topology, Coloring of graphs and hypergraphs, colorful complete \(p\)-partite hypergraph, local chromatic number, Mathematics - Combinatorics, Hypergraphs, Kneser hypergraphs, 05C65
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
