Back to Search
Start Over
Nowhere-zero 3-flows in matroid base graph.
- Source :
-
Frontiers of Mathematics in China . Feb2013, Vol. 8 Issue 1, p217-227. 11p. - Publication Year :
- 2013
-
Abstract
- The base graph of a simple matroid M = ( E,B) is the graph G such that V ( G) = B and E( G) = { BB′: B,B′ ∈ B, | B / B′| = 1}, where the same notation is used for the vertices of G and the bases of M. It is proved that the base graph G of connected simple matroid M is Z-connected if | V ( G)| ⩽ 5. We also proved that if M is not a connected simple matroid, then the base graph G of M does not admit a nowhere-zero 3-flow if and only if | V ( G)| = 4. Furthermore, if for every connected component E ( i ⩽ 2) of M, the matroid base graph G of M = M| E has | V ( G)| ⩽ 5, then G is Z-connected which also implies that G admits nowhere-zero 3-flow immediately. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 16733452
- Volume :
- 8
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Frontiers of Mathematics in China
- Publication Type :
- Academic Journal
- Accession number :
- 84765850
- Full Text :
- https://doi.org/10.1007/s11464-012-0246-x