Timeline for Cover a complete graph by smaller complete graphs
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 18, 2021 at 10:53 | comment | added | SagarM | Hi, I am quite out of my depths here, as I am clueless about projective planes, but how can I figure out the minimum number of 3-cliques required to cover a fully connected graph of size $n$? | |
| Nov 7, 2016 at 5:36 | vote | accept | Pluviophile | ||
| Nov 6, 2016 at 7:12 | history | edited | Ivan Izmestiev | CC BY-SA 3.0 |
added 742 characters in body
|
| Nov 6, 2016 at 6:30 | history | answered | Ivan Izmestiev | CC BY-SA 3.0 |