There is no polynomially bounded algorithm to test if a matroid (presented by an “independence oracle”) is binary. However, there is one to test graphicness. Finding this extends work of previous authors, who have given algorithms to test binary matroids for graphicness. Our main tool is a new result that ifM′ is the polygon matroid of a graphG, andM is a different matroid onE(G) with the same rank, then there is a vertex ofG whose star is not a cocircuit ofM.
AMS subject classification (1980)05 B 35 68 C 25
Unable to display preview. Download preview PDF.
- R. E. Bixby andW. H. Cunningham, Converting linear programs to network problems,Math. Operations Res., to appear.Google Scholar
- P. M. Jensen andB. Korte, Complexity of matroid property algorithms,Univ. of Bonn Tech. Report No. 78124-0RGoogle Scholar
- L. Lovász, The matroid matching problem, inAlgebraic Methods in Graph Theory, Proc. Coll. Math. Soc. J. Bolyai, North-Holland 1980.Google Scholar
- G. C. Robinson andD. J. A. Welsh, The computational complexity of matroid properties,to appear.Google Scholar
- D. J. A. Welsh,Matroid Theory, London Math. Soc. Monograph 8, Academic Press, 1976.Google Scholar