Open Problem Garden
Help
About
Contact
login/create account
Home
»
Author index
Seymour, Paul D.
Graph Theory
»
Coloring
»
Nowhere-zero flows
(2 + epsilon)-flow conjecture
★★★
Author(s):
Goddyn
;
Seymour
Conjecture
For every
there exists an integer
so that every
-
edge-connected
graph has a
-flow.
Keywords:
edge-connectivity
;
flow
Posted by
mdevos
updated March 7th, 2007
add new comment
« first
‹ previous
1
2
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