Timeline for Complexity of finding three perfect matchings with no edge in common in a bridgeless cubic graph
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 17, 2013 at 8:51 | history | edited | joro | CC BY-SA 3.0 |
Removed the wrong gadget
|
| Dec 17, 2013 at 8:09 | comment | added | joro | The proposed gadget appears wrong. The problem is A_e shares vertices in A and choosing an $n$ edge kills more than wanted edges in $A$. | |
| Dec 16, 2013 at 13:39 | history | edited | joro | CC BY-SA 3.0 |
Suggested gadget
|
| Dec 16, 2013 at 10:15 | history | asked | joro | CC BY-SA 3.0 |