Matroidal families were introduced by SimiSes-Ferefra [S]. Altb~ough we know uncountably many matroidai families of simple graphs and infinitely many matroidal families with multigraphs as members, it is an open question how one can find ail matroidal families. In this paper we give a solution of th
A characterization of matroidal systems of inequalities
β Scribed by M. Conforti; M. Laurent
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 800 KB
- Volume
- 69
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
~bl if and only if for each pair of , subsets R and S of E, such that IR (JSI ~3, either (i) VTcr E-(RUS), (RUT) E ZF+(SUT)E~
1+ Introductim ## 2. &tnatrsids An Z-nt~rfpis is 8 @-I matrix having thk. I+ 7 .Fyaty tha? some permuta-tion of its distinct ~ofutnns is the matrix J: I,\* fair some intttgcr r 2 '1. JP is the r \* r matrix of all 1's and lr is thbz F X r identity. Given an [-maitrix with r rows. the follc:wing pr
A matroid or oriented matroid is dyadic if it has a rational representation with all nonzero subdeterminants in [ \2 k : k # Z]. Our main theorem is that an oriented matroid is dyadic if and only if the underlying matroid is ternary. A consequence of our theorem is the recent result of G. Whittle th
In this paper we present the characterization of graphic matroids using the concept of a chord. Then we apply this characterization to solve a problem of Szamkolowicz [9]. One of the deepest theorems in the theory of matroids is Tuttes excludedminor characterization of graphic matroids [ 111. The p