✦ LIBER ✦

Frame Matroids and Biased Graphs

✍ Scribed by Thomas Zaslavsky

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 165 KB
Volume: 15
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1994.1034

No coin nor oath required. For personal study only.

✦ Synopsis

A frame matroid is any submatroid of a matroid in which cach point belongs to a line spanned by a fixed basis. A biased graph is a graph with certain polygons called balanced, no theta graph containing exactly two balanced polygons. We prove that certain matroids, called bias matroids, of biased graphs are identical to the finitary frame matroids. As an application we deduce two simple characterizations of frame matroids and some facts about planar forbidden minors for bias matroids.

📜 SIMILAR VOLUMES

The biased graphs whose matroids are bin

The biased graphs whose matroids are binary

✍ Thomas Zaslavsky 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Interval matroids and graphs

✍ F. Jaeger 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 519 KB

A base of the cycle space of a binary matroid M on E is said to be convex if its elements can be totally ordered in such a way that for every e E E tk set of elements of the base containing e is an interval. \'Ure show that a binary matroid is cographic iff it has a convex base of cycles; equivalent

On matroids and hierarchial graphs

✍ David Fernández-Baca; Mark A. Williams 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 601 KB

Antipodal graphs and oriented matroids

✍ Komei Fukuda; Keiichi Handa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 786 KB

A graph is antipodal if, for every vertex c', there exists exactly one vertex V which is not closer to r than every vertex adjacent to 6. In this paper we consider the problem of characterizing tope graphs of oriented matroids, which constitute a broad class of antipodal graphs. One of the results i

Supersolvable Frame-matroid and Graphic-

Supersolvable Frame-matroid and Graphic-lift Lattices

✍ Thomas Zaslavsky 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB

A geometric lattice is a frame if its matroid, possibly after enlargement, has a basis such that every atom lies under a join of at most two basis elements. Examples include all subsets of a classical root system. Using the fact that finitary frame matroids are the bias matroids of biased graphs, we

Matroid tree graphs and interpolation th

Matroid tree graphs and interpolation theorems

✍ Sanming Zhou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Using the Hamiltonicity of matroid tree graphs we give a new proof for an interpolation theorem of and other related results. From the proof we refine a general approach for dealing with interpolation problems of graphs. Let G be a simple, connected graph of order p and size q. For each integer m,