Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) (Q729778)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6668133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) |
scientific article; zbMATH DE number 6668133 |
Statements
Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) (English)
0 references
22 December 2016
0 references
Hamming graph
0 references
few-distance set
0 references
Euclidean representation
0 references
Erdős-Ko-Rado theorem
0 references
0 references
0.896246612071991
0 references
0.7951869964599609
0 references
0.7813138365745544
0 references
0.7700058817863464
0 references
0.7601866722106934
0 references
