On graphs embeddable in a layer of a hypercube and their extremal numbers

Maria Axenovich, Ryan R. Martin, Christian Winter

A graph is cubical if it is a subgraph of a hypercube. For a cubical graph $H$ and a hypercube $Q_n$, $ex(Q_n,H)$ is the largest number of edges in an $H$-free subgraph of $Q_n$.…