All Questions
Tagged with matroids complexity-theory
1 question
3
votes
0
answers
94
views
Is the intersection of $k \geq 3$ graphic matroids in P? [closed]
It is known that intersection of three general matroids is NP-hard (wiki), which is done via reduction from Hamiltonian cycle. The reduction uses one graphic matroid and two connectivity matroids.
A ...
