Basis graphs of even delta-matroids (Q864897): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2006.05.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2142685736 / rank | |||
Normal rank |
Revision as of 19:50, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Basis graphs of even delta-matroids |
scientific article |
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