Yue Ma

collaborators

2 papers

math.CO2026

An improvement bound on a problem of Picasarri-Arrieta and Rambaud

Bin Chen, Xinmin Hou, Yue Ma +2

Let $k$ and $ℓ$ be positive integers. A cycle with two blocks $C (k, ℓ)$ is a digraph consisting of two internally vertex disjoint directed paths of lengths $k$ and $ℓ$ with…

math.CO2025

Generalized TurÃ¡n problem with bounded matching number

Yue Ma, Xinmin Hou

For a graph $T$ and a set of graphs $H$ , let $\mbox{ex}(n,T,\mathcal{H})$ denote the maximum number of copies of $T$ in an $n$ -vertex $H$ -free graph. Recently,…