Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
