2 papers
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's…
math.CO2024
Spectral radius and the 2-power of Hamilton paths
Te Pi, Rui Sun, Long-Tu Yuan
We determine the maximum number of a graph without containing the 2-power of a Hamilton path. Using this result, we establish a spectral condition for a graph containing the 2-powe…