Frame matroids and biased graphs

DOI10.1006/EUJC.1994.1034MaRDI QIDQ1329081zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Thomas Zaslavsky

Publication date 10 October 1994

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1994.1034

zbMATH Keywords

biased graphforbidden minorframe matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Review text

A frame matroid is any submatroid of a matroid in which each point belongs to a line spanned by a fixed basis. A biased graph is a graph with certain polygons called balanced; no theta graph contains exactly two balanced polygons. It is proved that certain matroids associated with biased graphs are identical with the finitary frame matroids.

Recommendations

• Almost balanced biased graph representations of frame matroids
• Graphical representations of graphic frame matroids
• Biased graphs. II: The three matroids
• The biased graphs whose matroids are binary
• Biased graphs. I: Bias, balance, and gains

Cited in

(30)

• The biased graphs whose matroids are binary
• Biased graphs. II: The three matroids
• Characterizing bias matroids
• Biased graphs IV: Geometrical realizations
• On excluded minors for classes of graphical matroids
• Infinitely many excluded minors for frame matroids and for lifted-graphic matroids
• Biased graphs whose matroids are special binary matroids
• Supersolvable frame-matroid and graphic-lift lattices
• Biased expansions of biased graphs and their chromatic polynomials
• Matrix representations of frame and lifted-graphic matroids correspond to gain functions
• Tutte's dichromate for signed graphs
• Describing quasi-graphic matroids
• Biased graphs. VI: Synthetic geometry
• Biased graphs. VII: Contrabalance and antivoltages
• When does a biased graph come from a group labelling?
• Almost balanced biased graph representations of frame matroids
• Restricted frame graphs and a conjecture of Scott
• A short proof of Shih's isomorphism theorem on graphic subspaces
• Representability of matroids by c-arrangements is undecidable
• Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
• Matroids of gain graphs in applied discrete geometry
• Bounding and stabilizing realizations of biased graphs with a fixed group
• Varieties and universal models in the theory of combinatorial geometries
• Strong algorithms for the ordinal matroid secretary problem
• Projective planarity of matroids of 3-nets and biased graphs
• Excluding a line from complex-representable matroids
• On excluded minors of connectivity 2 for the class of frame matroids
• Graphical representations of graphic frame matroids
• Clones in 3-connected frame matroids
• Connectivity in frame matroids

This page was built for publication: Frame matroids and biased graphs

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