Graph Theory » Coloring » Nowhere-zero flows

(2 + epsilon)-flow conjecture ★★★

Author(s): Goddyn; Seymour

Conjecture   For every $ \epsilon>0 $ there exists an integer $ k $ so that every $ k $-edge-connected graph has a $ (2+\epsilon) $-flow.

Keywords: edge-connectivity; flow

Posted by mdevos
updated February 19th, 2020
1 comment
Graph Theory » Coloring » Nowhere-zero flows

3-flow conjecture ★★★

Author(s): Tutte

Conjecture   Every 4-edge-connected graph has a nowhere-zero 3-flow.

Keywords: nowhere-zero flow

Posted by mdevos
updated April 12th, 2011
1 comment
Graph Theory » Coloring » Nowhere-zero flows

4-flow conjecture ★★★

Author(s): Tutte

Conjecture   Every bridgeless graph with no Petersen minor has a nowhere-zero 4-flow.

Keywords: minor; nowhere-zero flow; Petersen graph

Posted by mdevos
updated April 12th, 2009
2 comments
Graph Theory » Coloring » Nowhere-zero flows

5-flow conjecture ★★★★

Author(s): Tutte

Conjecture   Every bridgeless graph has a nowhere-zero 5-flow.

Keywords: cubic; nowhere-zero flow

Posted by mdevos
updated March 7th, 2007
add new comment
Graph Theory » Coloring » Homomorphisms

Cores of Cayley graphs ★★

Author(s): Samal

Conjecture   Let $ M $ be an abelian group. Is the core of a Cayley graph (on some power of $ M $) a Cayley graph (on some power of $ M $)?

Keywords: Cayley graph; core

Posted by Robert Samal
updated February 29th, 2012
3 comments