For a graph , let be the largest number of edges in a subgraph of the hypercube of dimension that contains no subgraph isomorphic to . The Turán density of in a hypercube, denoted , is defined as . Determining remains a widely open question for general . Conlon found a large class of graphs with zero Turán density in a hypercube. In this note, we address the case when . If a graph is not embeddable in an edge-layer of a hypercube, then , as can be seen by taking every other edge layer of . Among the layered graphs, the only ones known to have positive Turán density in a hypercube are graphs containing cycles of length or . We show that, for every , there is a layered graph of girth at least whose Turán density in a hypercube is at least .

生成讲解博客的中文版本

生成AI智能校验的中文版本