The purpose of this paper is to answer a question of Ingleton by characterizing the class of ternary transversal matroids.
Gammoids and transversal matroids
β Scribed by A.W Ingleton; M.J Piff
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 906 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove that a finite family A of compact connected sets in R d has a hyperplane transversal if and only if for some k, 0<k<d, there exists an acyclic oriented matroid of rank k+1 on A such that every k+2 sets in A have an oriented k-transversal which meets the sets consistently with that oriented
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
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
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.