Timeline for Maximum matching in a graph with no "shortcuts"
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2023 at 19:56 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 75 characters in body
|
| Mar 6, 2023 at 19:55 | comment | added | Fedor Petrov | I think, yes, see Claim 14 (and all the previous) here theory.stanford.edu/~jvondrak/CS369P/lec4.pdf | |
| Mar 6, 2023 at 19:49 | comment | added | Max Alekseyev | Is there a way to compute the set $S$? | |
| Mar 6, 2023 at 19:07 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
deleted 45 characters in body
|
| Mar 6, 2023 at 19:00 | comment | added | Max Alekseyev | Looks nice! Thanks! | |
| Mar 6, 2023 at 17:46 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
edited body
|
| Mar 6, 2023 at 14:15 | history | answered | Fedor Petrov | CC BY-SA 4.0 |