Bin Chen

activity

20232026

collaborators

Showing math.COShow all

7 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…

math.CO2025

Paths with two blocks in oriented graphs of large minimum semi-degree

Bin Chen, Xinmin Hou, Xinyu Zhou

Stein (2020) conjectured that for any positive integer $k$ , every oriented graph of minimum semi-degree greater than $k /2$ contains every oriented path of length $k$ . This conjectu…

math.CO2024

Long antipaths and anticycles in oriented graphs

Bin Chen, Xinmin Hou, Hongyu Zhou

Let $δ^{0} (D)$ be the minimum semi-degree of an oriented graph $D$ . Jackson (1981) proved that every oriented graph $D$ with $δ^{0} (D) \geq k$ contains a directed path of length $2k…

math.CO2023

A new connectivity bound for a tournament to be highly linked

Bin Chen, Xinmin Hou, Gexin Yu +1

A digraph $D$ is $k$ -linked if for any pair of two disjoint sets ${x_{1}, x_{2}, \dots, x_{k}}$ and ${y_{1}, y_{2}, \dots, y_{k}}$ of vertices in $D$ , there exist vertex disjoint d…