Timeline for Minimum covers of complete graphs by $4$-cycles
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 29, 2017 at 15:41 | comment | added | Gerhard Paseman | I feel honored. Thanks for your scholarship and contributions. Gerhard "Really, I Do Feel Honored" Paseman, 2017.08.29. | |
| Aug 29, 2017 at 15:39 | comment | added | Tony Huynh | Yes, for $n$ even we can use the Paseman Theorem instead of the Heinrich, Horák, Rosa Theorem. | |
| Aug 29, 2017 at 15:28 | comment | added | Gerhard Paseman | How are the pairs of edges arranged for the n even case? I see how to do it with about n/4 four cycles, but not with n/8. (Oh, half the cycles are "in n choose 2". Coffee really helps.) Gerhard "Did Something Similar Just Below" Paseman, 2017.08.29. | |
| Aug 29, 2017 at 12:44 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 7 characters in body
|
| Aug 29, 2017 at 11:55 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 7 characters in body
|
| Aug 29, 2017 at 11:26 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 32 characters in body
|
| Aug 29, 2017 at 10:49 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 541 characters in body
|
| Aug 29, 2017 at 10:41 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 541 characters in body
|
| Aug 29, 2017 at 10:33 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 541 characters in body
|
| Aug 29, 2017 at 10:16 | vote | accept | Ashot | ||
| Aug 29, 2017 at 10:00 | history | edited | Tony Huynh | CC BY-SA 3.0 |
edited body
|
| Aug 29, 2017 at 9:48 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 59 characters in body
|
| Aug 29, 2017 at 9:29 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 228 characters in body
|
| Aug 29, 2017 at 9:18 | history | answered | Tony Huynh | CC BY-SA 3.0 |