Jie Ma

collaborators

5 papers

math.CO2023

Supersaturation beyond color-critical graphs

Jie Ma, Long-Tu Yuan

The supersaturation problem for a given graph $F$ asks for the minimum number $h_{F} (n, q)$ of copies of $F$ in an $n$ -vertex graph with $e x (n, F) + q$ edges. Subsequent works by Rademac…

math.CO2023

A property on monochromatic copies of graphs containing a triangle

Hao Chen, Jie Ma

A graph $H$ is called common and respectively, strongly common if the number of monochromatic copies of $H$ in a 2-edge-coloring $ϕ$ of a large clique is asymptotically minimised b…

math.CO2023

On local Turán density problems of hypergraphs

Chunqiu Fang, Guorong Gao, Jie Ma +1

For integers $q \geq p \geq r \geq 2$ , we say that an $r$ -uniform hypergraph $H$ has property $(q, p)$ , if for any $q$ -vertex subset $Q$ of $V (H)$ , there exists a $p$ -vertex subset $P$ of…

math.CO2023

Optimal bisections of directed graphs

Guanwu Liu, Jie Ma, Chunlei Zu

In this paper, motivated by a problem of Scott and a conjecture of Lee, Loh and Sudakov we consider bisections of directed graphs. We prove that every directed graph with $m$ arcs…

math.CO2021

Towards a conjecture of Birmelé-Bondy-Reed on the Erdős-Pósa property of long cycles

Jie Ma, Chunlei Zu

A conjecture of Birmelé, Bondy and Reed states that for any integer $ℓ \geq 3$ , every graph $G$ without two vertex-disjoint cycles of length at least $ℓ$ contains a set of at…