Jie Ma

activity

20232026

most citedOn the multicolor Turán conjecture for color-critical graphs

1 citations · 1 across the 8 of their papers we have counts for

collaborators

9 papers

cs.CC2026

NP-hardness of additive approximation for generalized Turán problems

Yihan Chen, Jialin He, Xihe Li +2

For a fixed graph $T$ and a fixed nonempty family $F$ of graphs, let $ex (G, T, F)$ denote the maximum number of copies of $T$ in an $F$ …

math.CO2026

Books versus Triangles near the n/6 Threshold

Kaizhe Chen, Jie Ma, Tianhen Wang

The book number $b (G)$ of a graph $G$ is the maximum number of triangles sharing a common edge. A strengthening of Mantel's theorem due to Rademacher states that every $n$ -vertex g…

math.CO2025

On the number of triangles in $K_{4}$ -free graphs

Jialin He, Jie Ma, Yan Wang +1

Erdős asked whether for any $n$ -vertex graph $G$ , the parameter $p^{*} (G) = min \sum_{i \geq 1} (∣ V (G_{i}) ∣ - 1)$ is at most $⌊ n^{2} /4 ⌋$ , where the minimum is taken over all edge…

math.CO2024

Uniquely colorable hypergraphs

Xizhi Liu, Jie Ma, Tianhen Wang +1

An $r$ -uniform hypergraph is uniquely $k$ -colorable if there exists exactly one partition of its vertex set into $k$ parts such that every edge contains at most one vertex from eac…

math.CO2024★ 1 cited

On the multicolor Turán conjecture for color-critical graphs

Xihe Li, Jie Ma, Zhiheng Zheng

A {\it simple $k$ -coloring} of a multigraph $G$ is a decomposition of the edge multiset as a disjoint sum of $k$ simple graphs which are referred as colors. A subgraph $H$ of a mul…

math.CO2024

Finding irregular subgraphs via local adjustments

Jie Ma, Shengjie Xie

For a graph $H$ , let $m (H, k)$ denote the number of vertices of degree $k$ in $H$ . A conjecture of Alon and Wei states that for any $d \geq 3$ , every $n$ -vertex $d$ -regular graph con…

math.CO2024

Weak rainbow saturation numbers of graphs

Xihe Li, Jie Ma, Tianying Xie

For a fixed graph $H$ , we say that an edge-colored graph $G$ is \emph{weakly $H$ -rainbow saturated} if there exists an ordering $e_{1}, e_{2}, \dots, e_{m}$ of $E\left(\overline{G}\righ…

math.CO2023

Supersaturation beyond color-critical graphs

Jie Ma, Long-Tu Yuan

The supersaturation problem for a given graph $F$ asks for the minimum number $h_{F} (n, q)$ of copies of $F$ in an $n$ -vertex graph with $e x (n, F) + q$ edges. Subsequent works by Rademac…

math.CO2023

Counting triangles in regular graphs

Jialin He, Xinmin Hou, Jie Ma +1

In this paper, we investigate the minimum number of triangles, denoted by $t (n, k)$ , in $n$ -vertex $k$ -regular graphs, where $n$ is an odd integer and $k$ is an even integer. The we…

NP-hardness of additive approximation for generalized Turán problems

Books versus Triangles near the n/6 Threshold

On the number of triangles in K4​-free graphs

Uniquely colorable hypergraphs

On the multicolor Turán conjecture for color-critical graphs

Finding irregular subgraphs via local adjustments

Weak rainbow saturation numbers of graphs

Supersaturation beyond color-critical graphs

Counting triangles in regular graphs

On the number of triangles in $K_{4}$ -free graphs