On the chromatic number of Kneser hypergraphs

94 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Generalized Kneser coloring theorems with combinatorial proofs (2001, methodology): “ovided acombinatorial bypass of the Borsuk-Ulam theorem, and thus a combinatorial proof of Kneser’s conjecture. This used only an entirely combinatorial special case of the Tucker lemma. Secondly, in [Mat00], Matouˇsek gave a simple and elegant derivation of Kriz’ theorem from Dold’s theorem. Here, ”
Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes (2005, methodology): “). K stab n,k is a vertex-critical subgraph of Kn,k, i.e., Kn,k is a vertex-critical graph, and χ(Kstab n,k ) = n−2k+2. 2.3.2.2. Chromatic numbers of Kneser hypergraphs. In 1986, Alon-Frankl-Lov´asz, [AFL86], have generalized Theorem 2.3.1 to the case of hypergraphs. To start with, recall the standa”
Tverberg’s theorem is 50 years old: A survey (2017, result): “l complex to intersection patterns of nite sets. It implies, generalizes, and unies several earlier results of this type, including those by Lovasz [Lov78], Dol’nikov [Dol88], Alon, Frankl, Lovasz [AFL86] and Krz [Kr92]. 7 Tverberg-type results in distinct settings 7.1 Convexity spaces and S-convexi”