r-graph

Seymour's r-graph conjecture ★★★

Author(s): Seymour

An $r$ -graph is an $r$ -regular graph $G$ with the property that $|\delta(X)| \ge r$ for every $X \subseteq V(G)$ with odd size.

Conjecture $\chi'(G) \le r+1$ for every $r$ -graph $G$ .

Posted by mdevos
updated October 3rd, 2008