Xinmin Hou

activity

20242026

collaborators

4 papers

math.CO2026

Monochromatic triangle-tilings in dense graphs without large independent sets

Xinmin Hou, Xiangyang Wang, Zhi Yin

Given two graphs $H$ and $G$ , an $H$ -tiling is a family of vertex-disjoint copies of $H$ in $G$ . A perfect $H$ -tiling covers all vertices of $G$ . The Corradi-Hajnal theorem (1963)…

math.CO2025

Divisible subdivisions of graphs in subdivisions of complete graphs

Xinmin Hou, Xiangyang Wang

Let $Z_{q}$ denote the cyclic group of order $q$ . A $Z_{q}$ -edge-weighted $K_{f}$ is the complete graph $K_{f}$ equipped with a weight function $ω: E(K_f) \to \mathbb{Z}_…

math.CO2025

Dirac-type condition for Hamilton-generated graphs

Xinmin Hou, Zhi Yin

The cycle space $C (G)$ of a graph $G$ is defined as the linear space spanned by all cycles in $G$ . For an integer $k \geq 3$ , let $C_{k} (G)$ denote the subspace of…

math.CO2024

The maximal sum of sizes of cross intersecting families for multisets

Hongkui Wang, Xinmin Hou

Let $k$ , $t$ and $m$ be positive integers. A $k$ -multiset of $[m]$ is a collection of $k$ elements of $[m]$ with repetition and without ordering. We use $\left(\binom {[m]}{k}\righ…