Open Problem Garden
Help
About
Contact
login/create account
Home
»
Keyword index
orientation
Graph Theory
»
Coloring
»
Nowhere-zero flows
Jaeger's modular orientation conjecture
★★★
Author(s):
Jaeger
Conjecture
Every
-
edge-connected
graph can be oriented so that
(mod
) for every vertex
.
Keywords:
nowhere-zero flow
;
orientation
Posted by
mdevos
updated March 7th, 2007
add new comment
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(227)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
r-regular graphs are not uniquely hamiltonian.
Partition of Complete Geometric Graph into Plane Trees
KPZ Universality Conjecture
3-Edge-Coloring Conjecture
Several ways to apply a (multivalued) multiargument function to a family of filters
more