Covering radius and the chromatic number of Kneser graphs

DOI10.1016/0097-3165(90)90011-KzbMath0729.05017OpenAlexW2119627333MaRDI QIDQ805622

Robert Calderbank

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(90)90011-k

zbMATH Keywords

covering radiusgraph coloringbinary linear codeKneser graphssubcode

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Intersection of Hamming codes avoiding Hamming subcodes

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• On the covering radius of a code and its subcodes
• A short proof of Kneser's conjecture
• On the chromatic number of the general Kneser-graph
• Subcodes and covering radius (Corresp.)