Xinmin Hou

activity

20182026

collaborators

10 papers

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

Exact values of rainbow Turán numbers for fan graphs and even wheel graphs

Xinmin Hou, Daoguang Xiong

An edge-colored graph is called rainbow if all its edges have distinct colors. For a fixed graph $H$ , the rainbow Turán number $\exstar(n, H)$ is the maximum number of edges in a p…

math.CO2026

Every connected subcubic graph except the Petersen graph is packing $(1, 1, 2, 2)$ -colorable

Xinmin Hou, Xujun Liu, Xiangyang Wang

For a non-decreasing sequence $S = (s_{1}, s_{2}, \dots, s_{k})$ of positive integers, a packing $S$ -coloring of a graph $G$ is a partition of $V (G)$ into $V_{1}, V_{2}, \dots, V_{k}$ such t…

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.CO2025

The generalized Turán number for K_3 in graphs without suspensions of a path on five vertices

Doudou Hei, Xinmin Hou, Yue Ma

Given graphs $H$ and $F$ , the generalized Turán number $\ex(n, H, F)$ is defined as the maximum number of copies of $H$ in an $n$ -vertex graph that contains no copy of $F$ . The sus…

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…

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…

math.CO2018

Codegree threshold for tiling $k$ -graphs with two edges sharing exactly $ℓ$ vertices

Lei Yu, Xinmin Hou

Given integer $k$ and a $k$ -graph $F$ , let $t_{k - 1} (n, F)$ be the minimum integer $t$ such that every $k$ -graph $H$ on $n$ vertices with codegree at least $t$ contains an $F$ -factor…

Oriented paths with two blocks in bipartite oriented graphs

Exact values of rainbow Turán numbers for fan graphs and even wheel graphs

Every connected subcubic graph except the Petersen graph is packing (1,1,2,2)-colorable

An improvement bound on a problem of Picasarri-Arrieta and Rambaud

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

The generalized Turán number for K_3 in graphs without suspensions of a path on five vertices

Long antipaths and anticycles in oriented graphs

A new connectivity bound for a tournament to be highly linked

Counting triangles in regular graphs

Codegree threshold for tiling k-graphs with two edges sharing exactly ℓ vertices

Every connected subcubic graph except the Petersen graph is packing $(1, 1, 2, 2)$ -colorable

Codegree threshold for tiling $k$ -graphs with two edges sharing exactly $ℓ$ vertices