Edge-covering number of 2-polymatroids
Statement
Let f be a 2-polymatroid function on S that has a matroid representation with the following property: for every and every circuit C of M. Is it true that , i.e. the minimum cover by matchings is at most one more than the minimum fractional cover by matchings?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.