Some extensions of a hypergraph

Abstract

It is shown how to construct a vertex-transitive hypergraph X* from a suitable collection of isomorphic copies of a given hypergraph X by identifying one or none of the vertices of every two copies in the collection. Moreover X* and X have the same strong chromatic number. If the hypergraph X is edge-coloured, then X* can be so constructed that it is strongly vertex-colour-transitive. This paper also considers the case where a section hypergraph or none of the vertices of every two isomorphic copies is identified in the construction of X*. © 1989 Springer-Verlag.