Showing 2026Show all
3 papers · 1 filter
math.CO2026
Counting triangles in graphs without suspensions of paths
Chunyang Dou, Xing Peng
For a graph , the suspension of is a graph obtained from by joining a new vertex to every vertex of . The generalized Turán number $\textrm{ex}(n,K_3,\wi…
math.CO2026
Spectral Turán problems for suspensions of balanced trees
Yaoxiang Di, Chunyang Dou
A central problem in spectral Turán theory is to understand the relationship between the spectral extremal family and the ordinary extremal family …
math.CO2026
Counting triangles in graphs with no wheels of order at least five
Chunyang Dou, Bo Ning, Xing Peng
For a family of graphs , a graph is said to be -free if it contains no member of as a subgraph. A wheel graph is a graph on ver…