1 paper
Jing Chen, Kai Gao, Yongxin Lan +2
Let H be a family of graphs. A graph is said to be H-free if it contains no subgraph isomorphic to a graph in H. The planar Turán number $ex_{_…