A 2-isomorphism theorem for hypergraphs

DOI10.1006/jctb.1997.1789zbMath0888.05045OpenAlexW2042927585MaRDI QIDQ1366606

Dirk Vertigan, Geoffrey P. Whittle

Publication date: 15 September 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/964ed8e1b2ce5f976d8edf5fea98d22ba5690e87

zbMATH Keywords

hypergraphcycle matroidpolymatroidWhitney's theorem2-isomorphic theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (4)

There exist non‐isomorphic STS(19) with equivalent point codes ⋮ ON MUTATION AND KHOVANOV HOMOLOGY ⋮ Kernelization of Whitney Switches ⋮ Kernelization of Whitney Switches

Cites Work

• Unnamed Item
• Unnamed Item
• On theories of Whitney and Tutte
• A geometric theory of hypergraph colouring
• A characterization of Tutte invariants of 2-polymatroids
• Vertex 2-isomorphism
• On Whitney's 2‐isomorphism theorem for graphs

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