Timeline for Mod $2$ information on perfect matchings in general graphs
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2020 at 18:51 | comment | added | John Machacek | Yes, we can get the parity in polynomial time. I added a bit about this to the answer to be more explicit to your question. | |
| Nov 18, 2020 at 18:50 | history | edited | John Machacek | CC BY-SA 4.0 |
additional explination
|
| Nov 18, 2020 at 6:50 | vote | accept | Turbo | ||
| Nov 18, 2020 at 6:28 | comment | added | Turbo | Is it in polynomial time? | |
| Nov 18, 2020 at 2:32 | history | answered | John Machacek | CC BY-SA 4.0 |