17 citations · 84 across the 50 of their papers we have counts for
9 papers · 1 filter
A strengthening on odd cycles in graphs of given chromatic number
Jun Gao, Qingyi Huo, Jie Ma
Resolving a conjecture of Bollobás and Erdős, Gyárfás proved that every graph of chromatic number contains cycles of distinct odd length…
Minimizing cycles in tournaments and normalized -norms
Jie Ma, Tianyun Tang
Akin to the Erdős-Rademacher problem, Linial and Morgenstern made the following conjecture in tournaments: for any , among all -vertex tournaments with $d\binom{n}{3…
A clique version of the Erdős-Gallai stability theorems
Jie Ma, Long-Tu Yuan
Combining Pósa's rotation lemma with a technique of Kopylov in a novel approach, we prove a generalization of the Erdős-Gallai theorems on cycles and paths. This implies a clique v…
On the rainbow matching conjecture for 3-uniform hypergraphs
Jun Gao, Hongliang Lu, Jie Ma +1
Aharoni and Howard, and, independently, Huang, Loh, and Sudakov proposed the following rainbow version of Erdős matching conjecture: For positive integers with , i…
The inducibility of oriented stars
Ping Hu, Jie Ma, Sergey Norin +1
We consider the problem of maximizing the number of induced copies of an oriented star in digraphs of given size, where the center of the star has out-degree and i…
Sparse halves in -free graphs
Xizhi Liu, Jie Ma
A conjecture of Chung and Graham states that every -free graph on vertices contains a vertex set of size that spans at most edges. We make t…