A 2-isomorphism theorem for hypergraphs
type: Item
instance of: scholarly article
title: A 2-isomorphism theorem for hypergraphs
zbMATH Open document ID: 0888.05045
author: Dirk Vertigan
author: Geoff Whittle
published in: Journal of Combinatorial Theory. Series B
publication date: 1997-09-15T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 1060751
zbMATH Keywords: polymatroid
zbMATH Keywords: hypergraph
zbMATH Keywords: cycle matroid
zbMATH Keywords: 2-isomorphic theorem
zbMATH Keywords: Whitney's theorem
MaRDI profile type: Publication
OpenAlex ID: W2042927585
cites work: Q4053708
cites work: Q3135082
cites work: A characterization of Tutte invariants of 2-polymatroids
cites work: Vertex 2-isomorphism
cites work: On Whitney's 2‐isomorphism theorem for graphs
cites work: On theories of Whitney and Tutte
cites work: A geometric theory of hypergraph colouring
DOI: 10.1006/JCTB.1997.1789
Recommended article: Q3317149
Recommended article: Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
Recommended article: Two Erdős-Hajnal-type theorems in hypergraphs
Recommended article: Q3469128
Recommended article: Q3001204
Recommended article: Two graph isomorphism polytopes
Recommended article: Two hypergraph theorems equivalent to BPI
Recommended article: A Torelli theorem for graph isomorphisms
Recommended article: On 2-Colorings of Hypergraphs
Recommended article: A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
description: scientific article; zbMATH DE number 1060751