Showing math.COShow all
2 papers · 1 filter
math.CO2025
The generalized Turán number for K_3 in graphs without suspensions of a path on five vertices
Doudou Hei, Xinmin Hou, Yue Ma
Given graphs and , the generalized Turán number $\ex(n, H, F)$ is defined as the maximum number of copies of in an -vertex graph that contains no copy of . The sus…
math.CO2022
Minimizing the number of matchings of fixed size in a -saturated graph
Jiejing Feng, Doudou Hei, Xinmin Hou
For a fixed graph , a graph is said to be -saturated if does not contain a subgraph isomorphic to but does contain after the addition of any new edge. Let $M_…