Isotropic matroids. I: Multimatroids and neighborhoods

MaRDI QIDQ727168zbMATH OpenFDO

Authors Robert Brijder, L. Traldi

Publication date 6 December 2016

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.04406, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p1

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

delta-matroidinterlacementisotropic systemlocal equivalencematroidmultimatroidstable set

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

Abstract: 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.

Review text

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.

Recommendations

• Isotropic matroids. III: Connectivity
• A characterization of circle graphs in terms of multimatroid representations
• Binary matroids and local complementation
• Multimatroids. II: Orthogonality, minors and connectivity
• Isotropic systems

Cites work

• A generalization of Tutte's characterization of totally unimodular matrices
• Binary matroids and local complementation
• Circle graph obstructions
• Decomposition of Directed Graphs
• Distance Hereditary Graphs and the Interlace Polynomial
• Distance-hereditary graphs
• Flots et tensions dans un graphe
• Graphic presentations of isotropic systems
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 4162893 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• Interlace polynomials for multimatroids and delta-matroids
• Isotropic matroids. II: Circle graphs
• Isotropic systems
• Multimatroids I. Coverings by Independent Sets
• Multimatroids. II: Orthogonality, minors and connectivity
• Multimatroids. III: Tightness and fundamental graphs
• Multimatroids. IV: Chain-group representations
• Nullity and loop complementation for delta-matroids
• Orienting transversals and transition polynomials of multimatroids
• Principal pivot transforms: Properties and applications
• Principally unimodular skew-symmetric matrices
• Rank-width and vertex-minors
• Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
• The adjacency matroid of a graph
• Transforming trees by successive local complementations

Cited in

(13)

• Multimatroids. II: Orthogonality, minors and connectivity
• The excluded 3-minors for vf-safe delta-matroids
• A characterization of circle graphs in terms of total unimodularity
• A characterization of circle graphs in terms of multimatroid representations
• Isotropic matroids. III: Connectivity
• The adjacency matroid of a graph
• Binary matroids and local complementation
• Matroids that classify forests
• The lattice of integer flows of a regular matroid
• Isotropical linear spaces and valuated Delta-matroids
• Orienting transversals and transition polynomials of multimatroids
• Isotropic matroids. II: Circle graphs
• Equivalent factor matroids of graphs

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Isotropic matroids. I: Multimatroids and neighborhoods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727168)