✦ LIBER ✦

A 2-Isomorphism Theorem for Hypergraphs

✍ Scribed by Dirk Vertigan; Geoff Whittle

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 330 KB
Volume: 71
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1997.1789

No coin nor oath required. For personal study only.

✦ Synopsis

One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising when two hypergraphs have isomorphic associated polymatroids.

📜 SIMILAR VOLUMES

Hall's theorem for hypergraphs

✍ Ron Aharoni; Penny Haxell 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

On Whitney's 2-isomorphism theorem for g

On Whitney's 2-isomorphism theorem for graphs

✍ K. Truemper 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

## Abstract Let __G__ and __H__ be 2‐connected 2‐isomorphic graphs with __n__ nodes. Whitney's 2‐isomorphism theorem states that __G__ may be transformed to a graph __G__\* isomorphic to __H__ by repeated application of a simple operation, which we will term “switching”. We present a proof of Whitn

Tellegen's theorem for 2-isomorphic netw

Tellegen's theorem for 2-isomorphic networks

✍ Cel, J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 51 KB

Let N and N I be directed networks having the same number of branches labelled correspondingly. It is proved that one of them can be reorientated so that u2 i "i2u for all vectors of corresponding branch voltages u, u and currents i, i satisfying Kirchhoff 's voltage and current law in every loop an

Recombination induced hypergraphs: A new

Recombination induced hypergraphs: A new approach to mutation-recombination isomorphism

✍ Paul Gitchoff; Günter P. Wagner 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

Natural selection acts on genetic variation that comes from two principal sources: mutation and recombination. Because of the inherent differences between mutation and recombination, it is often assumed that they are qualitatively different ways to explore the genotype space. In this paper a new way

Reductions in Circuit Complexity: An Iso

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem

✍ Manindra Agrawal; Eric Allender; Steven Rudich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 496 KB

We show that all sets that are complete for NP under nonuniform AC 0 reductions are isomorphic under nonuniform AC 0 -computable isomorphisms. Furthermore, these sets remain NP-complete even under nonuniform NC 0 reductions. More generally, we show two theorems that hold for any complexity class C c

A Theorem on Pure States on a Hypergraph

✍ Peter G. Ovchinnikov 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB