A 2-ISOMORPHISM THEOREM FOR HYPERGRAPHS

One can associate a polymatroid with a hypergraph that naturally gener alises the cycle matroid of a graph. Whitney's 2-isomorphism theorem c haracterises when two graphs have isomorphic cycle matroids. In this p aper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising when two hypergraphs have isomorphic associated poly matroids. (C) 1997 Academic Press.