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 characterization of a class of non-binary matroids
β Scribed by James G Oxley
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 478 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0095-8956
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~
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
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