Recognition of Seymour graphs
Statement
A graph G is said to be a Seymour graph if for any edge set F that satisfies for every circuit C of G, there exist pairwise disjoint cuts each containing exactly one element of F. Can we decide in polynomial time whether a graph is Seymour?
Record
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.