Extremal number of graphs from geometric shapes

We study the Turán problem for highly symmetric bipartite graphs arising from geometric shapes and periodic tilings commonly found in nature. The prism C2ℓ◻:=C2ℓ◻K2 is the graph consisting of two vertex disjoint 2ℓ-cycles and a matching pairing the corresponding vertices of these two cycles. We show that for every ℓ ≥ 4, ex(n,C2ℓ◻)=Θ(n3/2). This resolves a conjecture of He, Li and Feng. The hexagonal tiling in honeycomb is one of the most natural structures in the real world. We show that the extremal number of honeycomb graphs has the same order of magnitude as their basic building unit 6-cycles. We also consider bipartite graphs from quadrangulations of the cylinder and the torus. We prove near optimal bounds for both configurations. In particular, our method gives a very short proof of a tight upper bound for the extremal number of the 2-dimensional grid, improving a recent result of Bradač, Janzer, Sudakov and Tomon. Our proofs mix several ideas, including shifting embedding schemes, weighted homomorphism and subgraph counts and asymmetric dependent random choice. (Figure presented.)