The complexity of the matroid homomorphism problem
We show that for every binary matroid N there is a graph D(N) such that for the graphic matroid M(G) of a graph G, there is a matroid homomorphism from M(G) to N if and only if there is a graph homomorphism from G to D(N). With this we prove a complexity dichotomy for the problem HomM(N) of deciding...
Main Authors: | Heo, C. (Author), Kim, H. (Author), Siggers, M. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Australian National University
2023
|
Online Access: | View Fulltext in Publisher View in Scopus |
Similar Items
-
Matroids and complexity
by: Mayhew, Dillon
Published: (2005) -
The joints problem for matroids
by: Guth, Lawrence, et al.
Published: (2018) -
The linear matroid parity problem
by: Vande Vate, John H
Published: (2005) -
Some problems in matroid theory
by: Lemos, M. J. M. S.
Published: (1988) -
On the transversal matroid secretary problem
by: Thain, Nithum
Published: (2009)