Timeline for Maximum matching in a graph with no "shortcuts"
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 11, 2017 at 9:24 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 14 characters in body
|
| Mar 9, 2017 at 22:31 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 6 characters in body
|
| Mar 9, 2017 at 14:27 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 98 characters in body
|
| Mar 8, 2017 at 20:32 | vote | accept | Max Alekseyev | ||
| Mar 8, 2017 at 20:32 | comment | added | Max Alekseyev | Very nice! I'm quite surprised to see a non-constructive proof, all our attempts were constructive (algorithmic essentially). | |
| Mar 8, 2017 at 18:04 | history | answered | Tony Huynh | CC BY-SA 3.0 |