2 papers
math.CO2025
Planar Turán numbers of three configurations
Xuqing Bai, Zhipeng Gao, Ping Li
The planar Tuán number of , denoted by , is defined as the maximum number of edges in an -vertex -free planar graph. The exact value of $ex_{\mathc…
math.CO2025
The maximum number of cliques in disjoint copies of graphs
Zhipeng Gao, Ping Li, Changhong Lu +2
The problem of determining the maximum number of copies of in an -free graph, for any graphs and , was considered by Alon and Shikhelman. This is a variant of Turán'…