We proved in this paper https://arxiv.org/abs/2012.01764 that the answer is $2^{n/4+o(n)}$. As observed in the other answers, a counting argument shows that this is optimal (up to the lower order term).
Louis Esperet
- 935
- 7
- 13