most citedAn improved lower bound for the planar Turán number of cycles

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

math.CO2022★ 2 cited

An improved lower bound for the planar Turán number of cycles

Yongxin Lan, Zi-Xia Song

The planar Turán number of a graph , denoted by , is the largest number of edges in a planar graph on vertices without containing as a subgraph.…