2 papers
math.CO2024
The planar Turán number of
Tao Fang
Let be a set of graphs. The planar Turán number, , is the maximum number of edges in an -vertex planar graph which does not contai…
math.CO2023
Turán problems for linear forests and cliques
Tao Fang
Given a graph and a family of graphs . The generalized Turán number of is the maximum number of copies of in an -free graph on v…