Xinmin Hou

activity

20182026

collaborators

Showing 2023Show all

2 papers · 1 filter

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…

math.CO2023

Counting triangles in regular graphs

Jialin He, Xinmin Hou, Jie Ma +1

In this paper, we investigate the minimum number of triangles, denoted by $t (n, k)$ , in $n$ -vertex $k$ -regular graphs, where $n$ is an odd integer and $k$ is an even integer. The we…