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.
@article{10_37236_5222,
author = {Robert Brijder and Lorenzo Traldi},
title = {Isotropic matroids. {I:} {Multimatroids} and neighborhoods},
journal = {The electronic journal of combinatorics},
year = {2016},
volume = {23},
number = {4},
doi = {10.37236/5222},
zbl = {1351.05043},
url = {http://geodesic.mathdoc.fr/articles/10.37236/5222/}
}
TY - JOUR
AU - Robert Brijder
AU - Lorenzo Traldi
TI - Isotropic matroids. I: Multimatroids and neighborhoods
JO - The electronic journal of combinatorics
PY - 2016
VL - 23
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/5222/
DO - 10.37236/5222
ID - 10_37236_5222
ER -
%0 Journal Article
%A Robert Brijder
%A Lorenzo Traldi
%T Isotropic matroids. I: Multimatroids and neighborhoods
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/5222/
%R 10.37236/5222
%F 10_37236_5222
Robert Brijder; Lorenzo Traldi. Isotropic matroids. I: Multimatroids and neighborhoods. The electronic journal of combinatorics, Tome 23 (2016) no. 4. doi: 10.37236/5222
