Timeline for Cover a complete graph by smaller complete graphs
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 7, 2016 at 5:36 | vote | accept | Pluviophile | ||
| Nov 6, 2016 at 9:04 | comment | added | Brendan McKay | Note that I got the details wrong. See Ivan's answer for the correct version. | |
| S Nov 6, 2016 at 7:21 | history | suggested | Ivan Izmestiev | CC BY-SA 3.0 |
specified that we must cover all edges...
|
| Nov 6, 2016 at 7:18 | review | Suggested edits | |||
| S Nov 6, 2016 at 7:21 | |||||
| Nov 6, 2016 at 6:30 | answer | added | Ivan Izmestiev | timeline score: 13 | |
| Nov 6, 2016 at 0:00 | comment | added | Brendan McKay | Buzzwords "clique cover", "content decomposition", "covering number". Tons of variations. Some cases are very difficult, for example the question of whether $K_n$ can be exactly covered (no edge covered twice) by copies of $K_k$ for fixed $3\le k\le n$ is equivalent to the existence of projective planes of order $k$. | |
| Nov 5, 2016 at 23:41 | history | asked | Pluviophile | CC BY-SA 3.0 |