On Recognizing Frame and Lifted‐Graphic Matroids

We prove that there is no polynomial with the property that a matroid M can be determined to be either a lifted‐graphic or frame matroid using at most rank evaluations. This resolves two conjectures of Geelen, Gerards, and Whittle (Quasi‐graphic matroids, to appear in J. Graph Theory).