On the chromatic number of Kneser hypergraphs

DOI10.1090/S0002-9939-02-06371-2zbMath0986.05049OpenAlexW1697221527MaRDI QIDQ4330574

Ji{ří} Matoušek

Publication date: 13 May 2002

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-02-06371-2

zbMATH Keywords

chromatic numberKneser hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ Intersection patterns of finite sets and of convex sets ⋮ Extreme amenability of \(L_0\), a Ramsey theorem, and Lévy groups ⋮ Random Kneser graphs and hypergraphs ⋮ Extreme amenability of abelian \(L_0\) groups ⋮ Combinatorial Stokes formulas via minimal resolutions ⋮ Dold's theorem from viewpoint of strong compatibility graphs ⋮ Dimension gaps between representability and collapsibility

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalized Kneser conjecture
• Kneser's conjecture, chromatic number, and homotopy
• A certain combinatorial inequality
• A short proof of Kneser's conjecture
• Generalized Kneser coloring theorems with combinatorial proofs
• Simple proofs of some Borsuk-Ulam results
• The Chromatic Number of Kneser Hypergraphs
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers
• TRANSVERSALS OF FAMILIES OF SETS IN $ \mathbb{R}^n$ AND A CONNECTION BETWEEN THE HELLY AND BORSUK THEOREMS

This page was built for publication: On the chromatic number of Kneser hypergraphs