Bin Chen

activity

20232026

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

Oriented paths with two blocks in bipartite oriented graphs

Bin Chen, Meishuang Chen, Xinmin Hou +1

Stein conjectured that for any integer $k \geq 2$ , every oriented graph with minimum semidegree greater than $k /2$ contains every orientation of a path with $k$ edges. Recently, Che…

math.CO2026

Finite palette endpoints and degree-square Turán problems

Jiangdong Ai, Bin Chen, Ming Chen +2

We study finite palette extremal problems motivated by uniform Turán densities of $3$ -uniform hypergraphs. Given a self-converse tournament $T$ with at least two vertices, we deter…

math.CO2026

A weighted cycle-localization inequality

Jiangdong Ai, Bin Chen, Ming Chen +1

In 1959, Erdős and Gallai showed that every $2$ -connected graph $G$ contains a cycle of length at least $\frac{2∣ E ( G ) ∣}{∣ V ( G ) ∣ - 1}$ . This result was subsequently extended to weighte…

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…