Open Problem Garden
Help
About
Contact
login/create account
Home
ยป
The Berge-Fulkerson conjecture
Best known upper bound
On November 22nd, 2011 Anonymous says:
I believe that the best known upper bound is given here http://arxiv.org/abs/1111.1871
Reply
Are you a person?:
*
Subject:
Comment:
*
Comments are limited to a maximum of 1000 characters.
More information about formatting options
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
login/create account
Drupal
CSI of Charles University
Best known upper bound
I believe that the best known upper bound is given here http://arxiv.org/abs/1111.1871