Basis graphs of even delta-matroids (Q864897)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5125315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Basis graphs of even delta-matroids |
scientific article; zbMATH DE number 5125315 |
Statements
Basis graphs of even delta-matroids (English)
0 references
13 February 2007
0 references
A \(\Delta\)-matroid is a collection \({\mathcal B}\) of subsets of a finite set \(I\), called bases satisfying the symmetric exchange property. The basis graph of a \(\Delta\)-matroid is the graph whose vertices are the bases of \({\mathcal B}\) and two vertices are joined by an edge if their symmetric difference equals two. In this paper, the author presents a characterization of basis graphs of even \(\Delta\)-matroids (\(\Delta\)-matroids whose bases all have the same cardinality modulo 2).
0 references
basis graph
0 references
\(\Delta\)-matroid
0 references
graph distance
0 references
0 references
0.8729694485664368
0 references
0.8722496628761292
0 references
0.8290830850601196
0 references
0.8168198466300964
0 references
0.8108295202255249
0 references
