Bricks and conjectures of Berge, Fulkerson and Seymour

Details Bricks and conjectures of Berge, Fulkerson and Seymour Bricks and conjectures of Berge, Fulkerson and Seymour

2010-03-30

arxiv.org/abs/1003.5782v1

Computer Science

Discrete Mathematics

4 pages

Scientific paper

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$-edge-colorable, and also that any $r$-graph contains $2r$ perfect matchings such that each edge belongs to two of them. We show that the minimum counter-example to either of these conjectures is a brick. Furthermore we disprove a variant of a conjecture of Fan, Raspaud.

Affiliated with

Also associated with

No associations

Rating

Bricks and conjectures of Berge, Fulkerson and Seymour does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bricks and conjectures of Berge, Fulkerson and Seymour, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bricks and conjectures of Berge, Fulkerson and Seymour will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-80953