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.
Recommendations
- scientific article; zbMATH DE number 3847439
- Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
- Two Erdős-Hajnal-type theorems in hypergraphs
- scientific article; zbMATH DE number 4135988
- An isomorphism theorem for digraphs
- Two graph isomorphism polytopes
- Two hypergraph theorems equivalent to BPI
- A Torelli theorem for graph isomorphisms
- On 2-colorings of hypergraphs
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
Cites work
- A characterization of Tutte invariants of 2-polymatroids
- A geometric theory of hypergraph colouring
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3468904 (Why is no real title available?)
- On theories of Whitney and Tutte
- On Whitney's 2‐isomorphism theorem for graphs
- Vertex 2-isomorphism
Cited in
(12)- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
- A 2-isomorphism theorem for delta-matroids
- A short proof of Shih's isomorphism theorem on graphic subspaces
- scientific article; zbMATH DE number 3847439 (Why is no real title available?)
- ON MUTATION AND KHOVANOV HOMOLOGY
- scientific article; zbMATH DE number 4081581 (Why is no real title available?)
- There exist non‐isomorphic STS(19) with equivalent point codes
- scientific article; zbMATH DE number 913535 (Why is no real title available?)
- Kernelization of Whitney switches
- Hypergraphs With Finitely Many Isomorphism Subtypes
- Kernelization of Whitney Switches
- Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
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)