A 2-isomorphism theorem for hypergraphs
One can associate a polymatroid with a hypergraph that naturally generalizes the cycle matroid of a graph. Whitney's 2-isomorphic theorem characterizes when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalized to hypergraphs and polymatroids by characterizing when two hypergraphs have isomorphic associated polymatroids.
scientific article; zbMATH DE number 1060751
scientific article