Timeline for Maximal neighbour-full partition of $\{0,1\}^n$
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2015 at 1:47 | vote | accept | Real | ||
| Jun 16, 2015 at 1:47 | comment | added | Real | That's exactly the question. I'm engineering undergrad so I didn't know the technical graph theory terms. It seems my construction is sightly better than the shown lower bound; is this significant, should I email this to the author? With some effort I'm convinced now you could show $k(n)=a(n)$. | |
| Jun 15, 2015 at 8:34 | history | answered | Joshua Erde | CC BY-SA 3.0 |