The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined.

Abstract. The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined.

The vertex-diametric problem in binary Hamming spaces was solved by Kleit- man: Theorem 0.1 ([11]) V (2, n, d) = |F d/2 (2, n, n − d) ...

The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined.

May 1, 2008 · The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined.

The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined.

Bibliographic details on The Edge-Diametric Theorem in Hamming Spaces.

Mar 1, 2018 · Abstract: The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined.

Bibliographic details on The edge-diametric theorem in Hamming spaces.

Whereas there are vertex — and edge — isoperimetric theorems it went unsaid that diametric theorems are vertex — diametric theorems.