1 paper
Huiqing Liu, Tian Xie, Qin Zhao
Given a graph H, we call a graph H-free if it does not contain H as a subgraph. The planar Turán number of a graph H, denoted by exP(n,H), is the maximu…