8 papers
NP-hardness of additive approximation for generalized Turán problems
Yihan Chen, Jialin He, Xihe Li +2
Given a graph and a nonempty family of graphs, let denote the maximum number of copies of in an -free subg…
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…
Two problems of Burr, Erd\H os, Graham, and Sós on maximal anti-Ramsey functions for
Mingze Li, Bo Ning, Tianying Xie
Burr, Erd\H os, Graham, and Sós introduced the maximal anti-Ramsey function , the minimum number of colors required over all -vertex graphs with at least…
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…
Planar Turán number of quasi-double stars
Huiqing Liu, Tian Xie, Qin Zhao
Given a graph H, we call a graph if it does not contain H as a subgraph. The planar Turán number of a graph H, denoted by , is the maximum…
On the -clique cover number of graphs
Yihan Chen, Jialin He, Tianying Xie
In 1966, Erdős, Goodman, and Pósa proved that cliques are sufficient to cover all edges in any -vertex graph, with tightness achieved by the balanced com…
Weak rainbow saturation numbers of graphs
Xihe Li, Jie Ma, Tianying Xie
For a fixed graph , we say that an edge-colored graph is \emph{weakly -rainbow saturated} if there exists an ordering of $E\left(\overline{G}\righ…
Counting triangles in regular graphs
Jialin He, Xinmin Hou, Jie Ma +1
In this paper, we investigate the minimum number of triangles, denoted by , in -vertex -regular graphs, where is an odd integer and is an even integer. The we…