Timeline for At most one perfect matching of a bipartite graph
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 13, 2021 at 11:33 | vote | accept | User2021 | ||
| Jun 13, 2021 at 11:33 | |||||
| Jun 13, 2021 at 1:37 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 5 characters in body
|
| Jun 13, 2021 at 0:43 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 18 characters in body
|
| Jun 12, 2021 at 23:55 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 82 characters in body
|
| Jun 12, 2021 at 23:45 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 207 characters in body
|
| Jun 12, 2021 at 13:16 | comment | added | User2021 | The second question has constraints of $0/1$ mateching. I think I. is similar to II. in the constrained $0/1$ matching problem. | |
| Jun 12, 2021 at 11:24 | history | answered | Tony Huynh | CC BY-SA 4.0 |