Abstract
It has been conjectured that in any matroid, if W1, W2, W3 denote the number of points, lines, and planes respectively, then W22 ≥ W1W3. We prove this conjecture (and some strengthenings) for matroids in which no line has five or more points, thus generalizing a result of Stonesifer, who proved it for graphic matroids.
Original language | English (US) |
---|---|
Pages (from-to) | 17-26 |
Number of pages | 10 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 33 |
Issue number | 1 |
DOIs | |
State | Published - Aug 1982 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics