Jie Ma

activity

20122026

most citedStability results on the circumference of a graph

17 citations · 84 across the 50 of their papers we have counts for

collaborators

Showing 2019Show all

5 papers · 1 filter

math.CO2019

Monochromatic subgraphs in iterated triangulations

Jie Ma, Tianyun Tang, Xingxing Yu

For integers $n \geq 0$ , an iterated triangulation $T r (n)$ is defined recursively as follows: $T r (0)$ is the plane triangulation on three vertices and, for $n \geq 1$ , $T r (n)$ is the p…

math.CO2019

Counting critical subgraphs in $k$ -critical graphs

Jie Ma, Tianchi Yang

Gallai asked in 1984 if any $k$ -critical graph on $n$ vertices contains at least $n$ distinct $(k - 1)$ -critical subgraphs. The answer is trivial for $k \leq 3$ . Improving a result of…

math.CO2019

A conjecture of Verstraëte on vertex-disjoint cycles

Jun Gao, Jie Ma

Answering a question of Häggkvist and Scott, Verstraëte proved that every sufficiently large graph with average degree at least $k^{2} + 19 k + 10$ contains $k$ vertex-disjoint cycles of…

math.CO2019★ 6 cited

A unified proof of conjectures on cycle lengths in graphs

Jun Gao, Qingyi Huo, Chun-Hung Liu +1

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression…

math.CO2019

On a conjecture of Bondy and Vince

Jun Gao, Jie Ma

Twenty years ago Bondy and Vince conjectured that for any nonnegative integer $k$ , except finitely many counterexamples, every graph with $k$ vertices of degree less than three con…

Monochromatic subgraphs in iterated triangulations

Counting critical subgraphs in k-critical graphs

A conjecture of Verstraëte on vertex-disjoint cycles

A unified proof of conjectures on cycle lengths in graphs

On a conjecture of Bondy and Vince

Counting critical subgraphs in $k$ -critical graphs