Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. E. Bixby andW. H. Cunningham, Converting linear programs to network problems,Math. Operations Res., to appear.
D. A. Higgs, Strong maps of geometries,J. Combinatorial Theory 5 (1968), 185–191.
P. M. Jensen andB. Korte, Complexity of matroid property algorithms,Univ. of Bonn Tech. Report No. 78124-0R
L. Lovász, The matroid matching problem, inAlgebraic Methods in Graph Theory, Proc. Coll. Math. Soc. J. Bolyai, North-Holland 1980.
G. C. Robinson andD. J. A. Welsh, The computational complexity of matroid properties,to appear.
W. T. Tutte, An algorithm for determining whether a given binary matroid is graphic,Proc. Amer. Math. Soc. 11 (1960), 905–917.
D. J. A. Welsh,Matroid Theory, London Math. Soc. Monograph 8, Academic Press, 1976.