1 citations · 1 across the 8 of their papers we have counts for
8 papers · 1 filter
Books versus Triangles near the n/6 Threshold
Kaizhe Chen, Jie Ma, Tianhen Wang
The book number of a graph is the maximum number of triangles sharing a common edge. A strengthening of Mantel's theorem due to Rademacher states that every -vertex g…
On the number of triangles in -free graphs
Jialin He, Jie Ma, Yan Wang +1
Erdős asked whether for any -vertex graph , the parameter is at most , where the minimum is taken over all edge…
Uniquely colorable hypergraphs
Xizhi Liu, Jie Ma, Tianhen Wang +1
An -uniform hypergraph is uniquely -colorable if there exists exactly one partition of its vertex set into parts such that every edge contains at most one vertex from eac…
On the multicolor Turán conjecture for color-critical graphs
Xihe Li, Jie Ma, Zhiheng Zheng
A {\it simple -coloring} of a multigraph is a decomposition of the edge multiset as a disjoint sum of simple graphs which are referred as colors. A subgraph of a mul…
Finding irregular subgraphs via local adjustments
Jie Ma, Shengjie Xie
For a graph , let denote the number of vertices of degree in . A conjecture of Alon and Wei states that for any , every -vertex -regular graph con…
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…
Supersaturation beyond color-critical graphs
Jie Ma, Long-Tu Yuan
The supersaturation problem for a given graph asks for the minimum number of copies of in an -vertex graph with edges. Subsequent works by Rademac…
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…