Changes

A graph ''G'' is said to be a '''Seymour graph''' if for any edge set ''F'' there exist that satisfies <math>|C\cap F|\le |C\setminus F|</math> pairwise disjoint cuts each containing exactly one element of ''F'', provided forevery circuit ''C'' of ''G'' the necessary condition , there exist <math>|C\cap F|\le |C\setminus F|</math> issatisfiedpairwise disjoint cuts each containing exactly one element of ''F''. Can we decide in polynomial time whether a graph is Seymour?