Bricks and conjectures of Berge, Fulkerson and Seymour

Vahan Mkrtchyan, Eckhard Steffen

An $r$-graph is an $r$-regular graph where every odd set of vertices is connected by at least $r$ edges to the rest of the graph. Seymour conjectured that any $r$-graph is $r+1$-ed…