Isotropic matroids. I: Multimatroids and neighborhoods (Q727168)
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 6661353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Isotropic matroids. I: Multimatroids and neighborhoods |
scientific article; zbMATH DE number 6661353 |
Statements
Isotropic matroids. I: Multimatroids and neighborhoods (English)
0 references
6 December 2016
0 references
Summary: Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and several ways in which the isotropic matroid of \(G\) incorporates information about graphs locally equivalent to \(G\). Specific results of the latter type include a characterization of graphs that are locally equivalent to bipartite graphs, a direct proof that two forests are isomorphic if and only if their isotropic matroids are isomorphic, and a way to express local equivalence indirectly, using only edge pivots.
0 references
delta-matroid
0 references
interlacement
0 references
isotropic system
0 references
local equivalence
0 references
matroid
0 references
multimatroid
0 references
stable set
0 references
0.8519101738929749
0 references
0.8368030786514282
0 references
0.8034349083900452
0 references
0.7989484071731567
0 references
