On Graphs Embeddable in a Layer of a Hypercube and Their Extremal Numbers
{{output}}
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 . If ex ( Q n , H ) is at least a positive proportion of the number of edges in Q ... ...
