A 2-isomorphism theorem for delta-matroids
نویسندگان
چکیده
منابع مشابه
A 2-Isomorphism Theorem for Hypergraphs
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 hyper-graphs have isomorphic associated polymatroids. 1997 Academic Press
متن کاملA chain theorem for matroids
Tutte’s Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a wheel or a whirl, then M has a 3-connected minor N such that |E(M)| − |E(N)| = 1. Geelen and Whittle extended this theorem by showing that when M is sequentially 4-connected, the minor N can also be guaranteed to be sequentially 4connected, that is, for every 3-separation (X, Y ) of N , the set E(N) can be ...
متن کاملMenger's Theorem for Matroids
Menge r's Theore m asse rt s t hat if x and yare ve rti ces of a graph wh ic h a re not joined b y an edge and if it takes at least k ot he r vert ices to separate x and y, the n x and y can be JOined by k di s tinc t arcs "' the graph whic h have o nl y th eir e nd-vertices in common . . . Mu c h of the pape r is take n up by the de terminati on of an equiva le nt s tate me nt In volving th e ...
متن کاملHandle slides for delta-matroids
A classic exercise in the topology of surfaces is to show that, using handle slides, every disc-band surface, or 1-vertex ribbon graph, can be put in a canonical form consisting of the connected sum of orientable loops, and either non-orientable loops or pairs of interlaced orientable loops. Motivated by the principle that ribbon graph theory informs delta-matroid theory, we find the delta-matr...
متن کاملOn Exchange Axioms for Valuated Matroids and Valuated Delta-Matroids
Two further equivalent axioms are given for valuations of a matroid. Let M = (V,B) be a matroid on a finite set V with the family of bases B. For ω : B → R the following three conditions are equivalent: (V1) ∀B,B′ ∈ B, ∀u ∈ B −B′,∃v ∈ B′ −B: ω(B) + ω(B′) ≤ ω(B − u+ v) + ω(B′ + u− v); (V2) ∀B,B′ ∈ B with B 6= B′, ∃u ∈ B −B′,∃v ∈ B′ −B: ω(B) + ω(B′) ≤ ω(B − u+ v) + ω(B′ + u− v); (V3) ∀B,B′ ∈ B, ∀...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2021
ISSN: 0196-8858
DOI: 10.1016/j.aam.2020.102133