The clique distribution in powers of hypercubes
From MaRDI portal
Publication:2235258
Recommendations
Cites work
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A coloring problem on the \(n\)-cube
- A table of upper bounds for binary codes
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- Binary codes with a minimum distance of four (Corresp.)
- Error detecting and error correcting codes
- Improved upper bounds on sizes of codes
- On a combinatorial conjecture of Erdös
- Sharpening the Gilbert-Varshamov bound in the finite case
- Some results on the existence of binary linear codes (Corresp.)
- Strengthening the Gilbert-Varshamov bound
- The chromatic number of the square of the 8-cube
- The distinguishing number of the hypercube
- The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
Cited in
(3)
This page was built for publication: The clique distribution in powers of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235258)