Bin Chen

collaborators

3 papers

math.CO2024

On the $k$ -anti-traceability Conjecture

Bin Chen, Stefanie Gerke, Gregory Gutin +3

An oriented graph is called $k$ -anti-traceable if the subdigraph induced by every subset with $k$ vertices has a hamiltonian anti-directed path. In this paper, we consider an anti-…

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…

On the k-anti-traceability Conjecture

Long antipaths and anticycles in oriented graphs

A new connectivity bound for a tournament to be highly linked

On the $k$ -anti-traceability Conjecture