Timeline for Assigning positive edge weights to a graph so that the weight incident to each vertex is 1.
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 23, 2011 at 2:47 | vote | accept | mfolz | ||
| Mar 22, 2011 at 3:25 | answer | added | Gjergji Zaimi | timeline score: 8 | |
| Mar 22, 2011 at 0:08 | comment | added | JBL | Whoops, fair enough. All those pesky adjectives like "positive" and "connected" .... My apologies. | |
| Mar 22, 2011 at 0:06 | comment | added | Did | @JBL Connected. | |
| Mar 22, 2011 at 0:03 | comment | added | JBL | Didier, this is wrong: a set of disjoint edges works fine. (This is the only counter-example to your statement.) | |
| Mar 21, 2011 at 23:55 | answer | added | JBL | timeline score: 2 | |
| Mar 21, 2011 at 23:49 | comment | added | Did | More generally, no leaf is allowed if $G$ has more than $2$ vertices. | |
| Mar 21, 2011 at 23:42 | history | asked | mfolz | CC BY-SA 2.5 |