Timeline for What is the best way to partition the $4$-subsets of $\{1,2,3,\dots,n\}$?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 12:33 | comment | added | ArtOfProblemSolving | @RobPratt Oh yes you are right, thanks! | |
| Jun 16, 2020 at 1:55 | comment | added | RobPratt | The degree of every node is $$\binom{4}{2}\binom{n-4}{2}+\binom{4}{3}\binom{n-4}{1}=(3n-11)(n-4).$$ | |
| Jun 15, 2020 at 23:18 | vote | accept | ArtOfProblemSolving | ||
| Jun 15, 2020 at 10:35 | history | answered | LeechLattice | CC BY-SA 4.0 |