A characterization of hypergraphs which are products of a finite number of edges

Abstract

We prove that a hypergraph is a product of a finite number of edges if and only if it is interval-regular, satisfies the gated-edge property and has a vertex of finite degree. As a consequence, we get a characterization of Hamming graphs.

Keywords

• hypergraphs
• graphs
• hamming graphs
• hypercubes
• geodesics
• interval-regularity
• characterization theorems