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
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 23, 2011 at 2:47 | vote | accept | mfolz | ||
| Mar 22, 2011 at 20:57 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
added 503 characters in body
|
| Mar 22, 2011 at 15:06 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
added 13 characters in body
|
| Mar 22, 2011 at 4:40 | comment | added | Gjergji Zaimi | With a bit of care, it's not too hard to extend it to the locally finite case with the same proof, but I'm not sure what happens when you allow vertices to have infinite degree (does the OP want to consider such cases?), there are convergence issues and what not. I'll think about it some more. | |
| Mar 22, 2011 at 4:27 | comment | added | Gerry Myerson | This proof applies only to finite graphs, because of the reliance on the permanent of the adjacency matrix, right? | |
| Mar 22, 2011 at 3:25 | history | answered | Gjergji Zaimi | CC BY-SA 2.5 |