ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph G is said to be a Seymour graph if for any edge set F that satisfies ∣C∩F∣≤∣C∖F∣|C\cap F|\le |C\setminus F| for every circuit C of G, there exist ∣F∣|F| 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.