Timeline for Minimum covers of complete graphs by $4$-cycles
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 29, 2017 at 15:35 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
added 200 characters in body
|
| Aug 29, 2017 at 9:16 | comment | added | Gerhard Paseman | For n odd, three at a time may not work, but two at a time should. In any case, we should get within n/2 of the required n(n-1)/8 number of cycles. Gerhard "Will Ponder This While Asleep" Paseman, 2017.08.29. | |
| Aug 29, 2017 at 9:05 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |