An unbounded matroid intersection polyhedron

A characterization of the maximum-cardinality common independent sets of two matroids via an unbounded convex polyhedron is proved, confirming a conjecture of D.R. Fulkerson. A similar result, involving a bounded polyhedron, is the well-known matroid intersection polyhedron theorem of Jack Edmonds; Edmonds's theorem is used in the proof.