✦ LIBER ✦

On ternary transversal matroids

✍ Scribed by James G Oxley

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 806 KB
Volume: 62
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90043-9

No coin nor oath required. For personal study only.

✦ Synopsis

The purpose of this paper is to answer a question of Ingleton by characterizing the class of ternary transversal matroids.

📜 SIMILAR VOLUMES

Gammoids and transversal matroids

✍ A.W Ingleton; M.J Piff 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 906 KB

Ternary paving matroids

✍ James G. Oxley 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 578 KB

On Weak Maps of Ternary Matroids

✍ J Oxley; G Whittle 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Let M and N be ternary matroids having the same rank and the same ground set, and assume that every independent set in N is also independent in M. The main result of this paper proves that if M is 3-connected and N is connected and non-binary, then M = N . A related result characterizes precisely wh

On the quasi-transversals of a matroid

✍ Richard A. Brualdi; Amélia Fonseca 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 220 KB

We show that the set of r-quasi-transversals of a matroid, if nonempty, is the set of bases of a matroid. We also give an alternative proof of the known theorem which identifies the conjugate of the rank partition of a matroid.

Basis pair graphs of transversal matroid

Basis pair graphs of transversal matroids are connected

✍ Martin Farber 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 460 KB

The basis pair graph of a matroid on the ground set S has, as its vertices, ordered triples of the form (&, &, &), where B, and B2 are disjoint bases and B3 = S\(B, U 4). Two such vertices, (AI, AZ, As) and (Ri, B,, IQ, are adjacent if (B,, &, B3) can be obtained from (AI, A\*, As) by interchanging

A short proof that matching matroids are

A short proof that matching matroids are transversal

✍ Eberhard Triesch 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We present an elementary proof of the well-known theorem of E&nor& and Fkdkerson that a matroid is a matching matroid if and only if it is transversal. Suppose G = (V, E) is a simple graph. It is well-known that match(G), the collection of all X C V which are covered by some matching in G, is the sy