Stasys
|
Registered User
|
|
|
Mar 8 |
comment |
Invertibility of a certain matrix indexed by the Hamming cube [Here](lovelace.thi.informatik.uni-frankfurt.de/~jukna/…) is yet another elementary proof over GF(2). |
|
Jan 28 |
revised |
Do sparse DAGs can have large min-cuts? Corrected a typo in David's name. |
|
Jan 27 |
revised |
Do sparse DAGs can have large min-cuts? Added a link to the Kraft inequality |
|
Jan 27 |
answered | Do sparse DAGs can have large min-cuts? |
|
Jan 27 |
revised |
Do sparse DAGs can have large min-cuts? Removed useless remark, because long paths can be prolonged to st-paths |
|
Jan 22 |
revised |
Do sparse DAGs can have large min-cuts? A small correction in the expression for c_k(T_n) |
|
Jan 21 |
revised |
Do sparse DAGs can have large min-cuts? slight change in wording |
|
Jan 21 |
revised |
Do sparse DAGs can have large min-cuts? a misleading typo: divided by t, not times t |
|
Jan 21 |
revised |
Do sparse DAGs can have large min-cuts? 1-cut is just a cut |
|
Jan 21 |
asked | Do sparse DAGs can have large min-cuts? |
