Covering radius and the chromatic number of Kneser graphs

DOI10.1016/0097-3165(90)90011-KMaRDI QIDQ805622zbMATH OpenOpenAlexFDO

Authors 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

graph coloringcovering radiusKneser graphsbinary linear codesubcode

Mathematics Subject Classification ID

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

Recommendations

• On the covering radius of subcodes of a code
• Further results on the covering radius of codes
• On the covering radius of a code and its subcodes
• scientific article; zbMATH DE number 3965968
• Subcodes and covering radius (Corresp.)

Cites work

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

Cited in

(2)

• Critical problem for codes over finite chain rings
• Intersection of Hamming codes avoiding Hamming subcodes

This page was built for publication: Covering radius and the chromatic number of Kneser graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805622)