𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Quantifier for Isomorphisms

✍ Scribed by J. Ouko Väänänen

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
521 KB
Volume
26
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A quantifier for matroid duality
A quantifier for matroid duality
✍ T.A. McKee 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 480 KB

A quantikr is introduced on the elements e, , . .". The sr;qtroid dual of this quantifier is sholvn to be identical with its logkal dual, and this provides an elegant reformulation of Minty's sd2lf+iual axiomatization of mat&is. This approach also provides a practical, and in a sense optimal, n~ans

P3-isomorphisms for graphs
P3-isomorphisms for graphs
✍ Aldred, R. E. L.; Ellingham, M. N.; Hemminger, R. L.; Jipsen, P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

The P 3 -graph of a finite simple graph G is the graph whose vertices are the 3-vertex paths of G, with adjacency between two such paths whenever their union is a 4-vertex path or a 3-cycle. In this paper we show that connected finite simple graphs G and H with isomorphic P 3 -graphs are either isom

A 2-Isomorphism Theorem for Hypergraphs
A 2-Isomorphism Theorem for Hypergraphs
✍ Dirk Vertigan; Geoff Whittle 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 330 KB

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 wh