Note on binary simplicial matroids
✍ Scribed by Jiří Tůma
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 117 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Using an earlier characterization of simplicial hypergraphs we obtain a characterization of binary simplicial matroids in terms of the existence of a special base.
📜 SIMILAR VOLUMES
In this paper, we shall consider the following problem: up to duality, is a connected matroid reconstructible from its connectivity function? Cunningham conjectured that this question has an affirmative answer, but Seymour gave a counter-example for it. In the same paper, Seymour proved that a conne
A k-connected matroid M with at least four elements is (k,2)-rounded if it satisfies the following condition. Whenever e and f are elements of a k-connected matroid N having M as a minor, then N has a minor which uses e and f and is isomorphic to M. We show that, for k exceeding three, a (k, 2)-roun
In this paper, it is shown that, for a minor-closed class ~ of matroids, the class of matroids in which every hyperplane is in J¢' is itself minor-closed and has, as its excluded minors, the matroids U1,1 @ N such that N is an excluded minor for ,g. This result is applied to the class of matroids of