Showing 2026Show all
3 papers · 1 filter
cs.CC2026
NP-hardness of additive approximation for generalized Turán problems
Yihan Chen, Jialin He, Xihe Li +2
For a fixed graph and a fixed nonempty family of graphs, let denote the maximum number of copies of in an …
math.CO2026
The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs
Yihan Chen, Tianying Xie
For graphs and , a spanning subgraph of is weakly -saturated in if the edges in can be added one at a time, each addition creating a new…
math.CO2026
Saturation numbers for -uniform Berge-
Yihan Chen, Jialin He, Tianying Xie
The saturation number is the minimum number of hyperedges in an -uniform -saturated hypergraph on vertices. We determine this para…