A Characterization Of Weakly Bipartite Graphs (Extended Abstract)

Abstract

A labeled graph is said to be weakly bipartite if the clutter of its odd cycles is ideal. Seymour conjectured that a labeled graph is weakly bipartite if and only if it does not contain a minor called an odd K5 . A proof of this conjecture is given in this paper