17 citations · 84 across the 50 of their papers we have counts for
50 papers
Sharp vertex connectivity of the Markoff graphs modulo
Jie Ma, Mengxi Yang, Zichen Yang
For a prime and , the generalized Markoff graph is an undirected graph whose vertices are the solutions over the finite field of the…
Phase Transitions of Structured Codes of Graphs
Bo Bai, Yu Gao, Jie Ma +1
We consider the symmetric difference of two graphs on the same vertex set , which is the graph on whose edge set consists of all edges that belong to exactly one of the…
On Two problems of defective choosability
Jie Ma, Rongxing Xu, Xuding Zhu
Given positive integers , and a non-negative integer , we say a graph is -choosable if for every list assignment with for each $v \in V(…
Partitioning graphs with linear minimum degree
Jie Ma, Hehui Wu
We prove that there exists an absolute constant such that, for any positive integer , every graph with minimum degree at least admits a vertex-partition $V(G)=S\c…
A property on monochromatic copies of graphs containing a triangle
Hao Chen, Jie Ma
A graph is called common and respectively, strongly common if the number of monochromatic copies of in a 2-edge-coloring of a large clique is asymptotically minimised b…
On local Turán density problems of hypergraphs
Chunqiu Fang, Guorong Gao, Jie Ma +1
For integers , we say that an -uniform hypergraph has property , if for any -vertex subset of , there exists a -vertex subset of…