On generalized Kneser hypergraph colorings

In 2002, the second author presented a lower bound for the chromatic numbers of hypergraphs KG s r S , “generalized r-uniform Kneser hypergraphs with intersection multiplicities s.” It generalized previous lower bounds by Kříž (1992/2000) for the case s = ( 1 , … , 1 ) without intersection multiplicities, and by Sarkaria (1990) for S = ( [ n ] k ) . Here we discuss subtleties and difficulties that arise for intersection multiplicities s i > 1 :(1) presence of intersection multiplicities, there are two different versions of a “Kneser hypergraph,” depending on whether one admits hypergraph edges that are multisets rather than sets. We show that the chromatic numbers are substantially different for the two concepts of hypergraphs. The lower bounds of Sarkaria (1990) and Ziegler (2002) apply only to the multiset version. ductions to the case of prime r in the proofs by Sarkaria and by Ziegler work only if the intersection multiplicities are strictly smaller than the largest prime factor of r. Currently we have no valid proof for the lower bound result in the other cases. so show that all uniform hypergraphs without multiset edges can be represented as generalized Kneser hypergraphs.