$C_{10}$ has positive Turán density in the hypercube

Abstract

The $n$-dimensional hypercube $Q_n$ is a graph with vertex set $\{0,1{\}}^n$ such that there is an edge between two vertices if and only if they differ in exactly one coordinate. For any graph $H$, define $\text{ex}(Q_n,H)$ to be the maximum number of edges of a subgraph of $Q_n$ without a copy of $H$. In this short note, we prove that for any $n\in \mathbb{N}$ $$\text{ex}(Q_n,C_{10})>0.036\cdot e(Q_n).$$ Our construction is strongly inspired by the recent breakthrough work of Ellis, Ivan, and Leader, who showed that "daisy" hypergraphs have positive Turán density with an extremely clever and simple linear-algebraic argument.

6 pages. Corrected the statement of Theorem 1.2 and improved the density bound from 0.024 to 0.036