Timeline for Double cover the edges of a complete graph by smaller complete graphs
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 3 at 8:58 | history | became hot network question | |||
| Mar 3 at 3:03 | vote | accept | Wallace Rin | ||
| Mar 3 at 2:56 | answer | added | Tony Huynh | timeline score: 6 | |
| Mar 3 at 1:21 | comment | added | Wojowu | This problem has a more set-combinatorial description which may be easier to find results on - you are seeking a collection of $k$ $m$-element subsets of $[n]$ such that each pair of elements is contained in exactly two of these elements. I'm afraid I cannot comment on what results there are known about this. | |
| S Mar 3 at 0:52 | review | First questions | |||
| Mar 3 at 2:27 | |||||
| S Mar 3 at 0:52 | history | asked | Wallace Rin | CC BY-SA 4.0 |