Xinmin Hou

activity

20172022

most citedThe spectral radius of graphs without long cycles

2 citations · 5 across the 16 of their papers we have counts for

collaborators

19 papers

math.CO2022

The degree and codegree threshold for linear triangle covering in 3-graphs

Yuxuan Tang, Yue Ma, Xinmin Hou

Given two $k$ -uniform hypergraphs $F$ and $G$ , we say that $G$ has an $F$ -covering if every vertex in $G$ is contained in a copy of $F$ . For $1 \leq i \leq k - 1$ , let $c_{i} (n, F)$ be the…

math.CO2022

Minimizing the number of matchings of fixed size in a $K_{s}$ -saturated graph

Jiejing Feng, Doudou Hei, Xinmin Hou

For a fixed graph $F$ , a graph $G$ is said to be $F$ -saturated if $G$ does not contain a subgraph isomorphic to $F$ but does contain $F$ after the addition of any new edge. Let $M_…

math.CO2022

Maximum size of $C_{\leq k}$ -free strong digraphs with out-degree at least two

Bin Chen, Xinmin Hou

Let $H$ be a family of digraphs. A digraph $D$ is \emph{ $H$ -free} if it contains no isomorphic copy of any member of $H$ . For $k \geq 2$ , we set $C_{\le…

math.CO2022

A note on shortest circuit cover of 3-edge colorable cubic signed graphs

Ronggui Xu, Jiaao Li, Xinmin Hou

A {sign-circuit cover} $F$ of a signed graph $(G, σ)$ is a family of sign-circuits which covers all edges of $(G, σ)$ . The shortest sign-circuit cover problem was initiat…

math.CO2022

Maximal fractional cross-intersecting families

Hongkui Wang, Xinmin Hou

Given an irreducible fraction $\frac{c}{d} \in [0, 1]$ , a pair $(A, B)$ is called a $\frac{c}{d}$ -cross-intersecting pair of $2^{[n]}$ if $\mathcal{A}, \mathcal{B…

math.CO2021

Rainbow independent sets in graphs with maximum degree two

Yue Ma, Xinmin Hou, Jun Gao +2

Given a graph $G$ , let $f_{G} (n, m)$ be the minimal number $k$ such that every $k$ independent $n$ -sets in $G$ have a rainbow $m$ -set. Let $D (2)$ be the family of all grap…

The degree and codegree threshold for linear triangle covering in 3-graphs

Minimizing the number of matchings of fixed size in a Ks​-saturated graph

Maximum size of C≤k​-free strong digraphs with out-degree at least two

A note on shortest circuit cover of 3-edge colorable cubic signed graphs

Maximal fractional cross-intersecting families

Rainbow independent sets in graphs with maximum degree two

Minimizing the number of matchings of fixed size in a $K_{s}$ -saturated graph

Maximum size of $C_{\leq k}$ -free strong digraphs with out-degree at least two