A 2-isomorphism theorem for hypergraphs

From MaRDI portal





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.











This page was built for publication: A 2-isomorphism theorem for hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366606)