Timeline for Would a graph with such maximum weighted matchings exist?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 9, 2012 at 12:22 | comment | added | Tony Huynh | As I mention in the comments, the same proof also answers your edited question. I added a proof, but it is really just a cut and paste job. | |
| Nov 9, 2012 at 11:55 | history | edited | joro | CC BY-SA 3.0 |
Dumb me, meant edges
|
| Nov 9, 2012 at 10:59 | answer | added | Tony Huynh | timeline score: 1 | |
| Nov 9, 2012 at 10:55 | history | edited | joro | CC BY-SA 3.0 |
Corrected the path with 3 edges
|
| Nov 9, 2012 at 10:51 | comment | added | joro | @Tony yes, indeed I mean three edges, thank you. | |
| Nov 9, 2012 at 10:44 | comment | added | Tony Huynh | Just to clarify, by $vv'v''$ you mean a path with three edges, not three vertices right? | |
| Nov 9, 2012 at 10:25 | history | asked | joro | CC BY-SA 3.0 |