Gašper Domen Romih: Cut method for partial Hamming hypergraphs

Abstract. We define the notion of Hamming hypergraphs which are generalization of Hamming graphs to hypergraphs. We also characterize hypergraphs that are isometrically embeddable into Hamming hypergraphs. Those hypergraphs admits certain properties, which are required for the cut method to work. It turns out that such hypergraphs must be linear. Therefore we present some extension methods that results in non-linear hypergraphs, where cut method can still be applied.