Open Problem Garden

Help
About
Contact

login/create account

Home » The Berge-Fulkerson conjecture

proof of log(n)

On October 14th, 2011 Anonymous says:

Do you know a reference for a proof this log(n) boundary? I looked for it in text book but I don't have any clue.

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 (228)
- Group Theory (5)
- Logic (10)
- Number Theory (49)
- PDEs (0)
- Probability (1)
- Theoretical Comp. Sci. (13)
- Topology (40)
- Unsorted (1)
Author index
Keyword index

Recent Activity

Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.

Powered by

Drupal Hosted by

CSI of Charles University Content distributed under

Disclaimer