Bin Chen

works on

directed graphs 1 extremal combinatorics 1 hypergraphs 1 palette extremal problems 1 turan problems 1

From the 1 of 4 linked papers with an AI index.

collaborators

4 papers

math.CO2026

Finite palette endpoints and degree-square TurÃ¡n problems

Jiangdong Ai, Bin Chen, Ming Chen +2

The paper investigates extremal color‑palette problems motivated by uniform Turán densities of 3‑uniform hypergraphs, showing they reduce to maximizing the sum of squared out‑degre…

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

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…