3 citations · 8 across the 21 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
Maximum cliques in a graph without disjoint given subgraph
Fangfang Zhang, Yaojun Chen, Ervin Gyori +1
The generalized Turán number $\ex(n,K_s,F)$ denotes the maximum number of copies of in an -vertex -free graph. Let denote disjoint copies of . Gerbner, Meth…
math.CO2023
Extremal problems for a matching and any other graph
Xiutao Zhu, Yaojun Chen
For a family of graphs $\F$, a graph is called $\F$-free if it does not contain any member of $\F$ as a subgraph. The generalized Turán number $\ex(n,K_r,\F)$ is the maximum number…
math.CO2023★ 1 cited
A new construction for planar Turán number of cycle
Ervin Győri, Kitti Varga, Xiutao Zhu
The planar Turán number is the largest number of edges in an -vertex planar graph with no cycle of length . Let and be constan…