Extremal subgraphs of the $d$-dimensional grid graph

Geir Agnarsson, Kshitij Lauria

For each natural number $n$ we determine, both asymptotically and exactly, the maximum number of edges an induced subgraph of order $n$ of the $d$-dimension a grid graph ${\ints}^d…