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 2016Show all

4 papers · 1 filter

math.CO2016★ 1 cited

Some extremal results on complete degenerate hypergraphs

Jie Ma, Xiaofan Yuan, Mingwei Zhang

Let $K_{s_{1}, s_{2}, \dots, s_{r}}^{(r)}$ be the complete $r$ -partite $r$ -uniform hypergraph and $e x (n, K_{s_{1}, s_{2}, \dots, s_{r}}^{(r)})$ be the maximum number of edges in any $n$ -vertex $K^{…

math.CO2016★ 4 cited

Cycles with two blocks in $k$ -chromatic digraphs

Ringi Kim, Seog-Jin Kim, Jie Ma +1

Let $k$ and $ℓ$ be positive integers. A cycle with two blocks $c (k, ℓ)$ is an oriented cycle which consists of two internally (vertex) disjoint directed paths of lengths at le…

math.CO2016★ 5 cited

Cycles of given lengths in hypergraphs

Tao Jiang, Jie Ma

In this paper, we develop a method for studying cycle lengths in hypergraphs. Our method is built on earlier ones used in [21,22,18]. However, instead of utilizing the well-known l…

math.CO2016

On edges not in monochromatic copies of a fixed bipartite graph

Jie Ma

Let $H$ be a fixed graph. Denote $f (n, H)$ to be the maximum number of edges not contained in any monochromatic copy of $H$ in a 2-edge-coloring of the complete graph $K_{n}$ , and $ex…

Some extremal results on complete degenerate hypergraphs

Cycles with two blocks in k-chromatic digraphs

Cycles of given lengths in hypergraphs

On edges not in monochromatic copies of a fixed bipartite graph

Cycles with two blocks in $k$ -chromatic digraphs