Xinmin Hou

activity

20152026

K_{4}^{-}

-saturated graphs

5 citations · 17 across the 35 of their papers we have counts for

collaborators

36 papers

eess.SP2026

A Multi-View Low-Latency Direction-Sensing for Low-Altitude Network via a Multi-Armed Array

Jinbing Jiang, Feng Shu, Jiangzhou Wang

Due to the directional antenna pattern, the received signal power decreases when the target deviates from the array boresight, degrading direction-sensing accuracy. Although rotata…

math.CO2026

Tight lower bound for the spectral radius of connected graphs with given matching number

Xinmin Hou, Li Tan

Let $G_{n, k}$ denote the family of all connected graphs of order $n$ with matching number $k$ . Liu, Lou, and Trevisan~(Linear Algebra Appl., 2026) posed the following pro…

math.CO2023

Ramsey numbers of color critical graphs versus large generalized fans

Taiping Jiang, Xinmin Hou

Given two graphs $G$ and $H$ , the {Ramsey number} $R (G, H)$ is the smallest positive integer $N$ such that every 2-coloring of the edges of $K_{N}$ contains either a red $G$ or a bl…

math.CO2023

The degree threshold for covering with all the connected $3$ -graphs with $3$ edges

Yue Ma, Xinmin Hou, Zhi Yin

Given two $r$ -uniform hypergraphs $F$ and $H$ , we say that $H$ has an $F$ -covering if every vertex in $H$ is contained in a copy of $F$ . Let $c_{i} (n, F)$ be the least integer such…

math.CO2023

Multicolor Ramsey numbers on stars versus pat

Xuejun Zhang, Xinmin Hou

For given simple graphs $H_{1}, H_{2}, \dots, H_{c}$ , the multicolor Ramsey number $R (H_{1}, H_{2}, \dots, H_{c})$ is defined as the smallest positive integer $n$ such that for an arbitrary edge-dec…

math.CO2023

Graphs without rainbow cliques of orders four and five

Yue Ma, Xinmin Hou

Let $G_{n}^{k} = {G_{1}, G_{2}, \dots, G_{k}}$ be a multiset of graphs on vertex set $[n]$ and let $F$ be a fixed graph with edge set $F = {e_{1}, e_{2}, \dots, e_{m}}$ and $k \geq m$ . We sa…

math.CO2023

On Induced Subgraph of Cartesian Product of Paths

Jiasheng Zeng, Xinmin Hou

Chung, Füredi, Graham, and Seymour (JCTA, 1988) constructed an induced subgraph of the hypercube $Q^{n}$ with $α (Q^{n}) + 1$ vertices and with maximum degree smaller than $\lceil \sqrt{n…

math.CO2023

Spectral extrema of graphs with bounded clique number and matching number

Hongyu Wang, Xinmin Hou, Yue Ma

For a set of graphs $F$ , let $\ex(n,\mathcal{F})$ and $\spex(n,\mathcal{F})$ denote the maximum number of edges and the maximum spectral radius of an $n$ -vertex $\mathcal…

math.CO2023

Generalized Turán problem with bounded matching number

Yue Ma, Xinmin Hou

For a graph $T$ and a set of graphs $H$ , let $\mbox{ex}(n,T,\mathcal{H})$ denote the maximum number of copies of $T$ in an $n$ -vertex $H$ -free graph. Recently,…

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

The cycle of length four is strictly $F$ -Turán-good

Doudou Hei, Xinmin Hou

Given an $(r + 1)$ -chromatic graph $F$ and a graph $H$ that does not contain $F$ as a subgraph, we say that $H$ is strictly $F$ -Turán-good if the Turán graph $T_{r} (n)$ is the unique…

cs.LG2022

An Improved Probability Propagation Algorithm for Density Peak Clustering Based on Natural Nearest Neighborhood

Wendi Zuo, Xinmin Hou

Clustering by fast search and find of density peaks (DPC) (Since, 2014) has been proven to be a promising clustering approach that efficiently discovers the centers of clusters by…

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

Some exact results of the generalized Turán numbers for paths

Doudou Hei, Xinmin Hou, Boyuan Liu

For graphs $H$ and $F$ with chromatic number $χ (F) = k$ , we call $H$ strictly $F$ -Turán-good (or $(H, F)$ strictly Turán-good) if the Turán graph $T_{k - 1} (n)$ is the unique $F$ -free…

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…

math.CO2021

Strongly connected orientation with minimum lexicographic order of indegrees

Hongyu Zhou, Xinmin Hou

Given a simple undirected graph $G$ , an orientation of $G$ is to assign every edge of $G$ a direction. Borradaile et al gave a greedy algorithm SC-Path-Reversal (in polynomial time…

math.CO2020★ 1 cited

The Turán number for the edge blow-up of trees

Anyao Wang, Xinmin Hou, Boyuan Liu +1

The edge blow-up of a graph $F$ is the graph obtained from replacing each edge in $F$ by a clique of the same size where the new vertices of the cliques are all different. In this…

math.CO2020★ 1 cited

A Dirac-type theorem for uniform hypergraphs

Yue Ma, Xinmin Hou, Jun Gao

Dirac (1952) proved that every connected graph of order $n > 2 k + 1$ with minimum degree more than $k$ contains a path of length at least $2 k + 1$ . Erdős and Gallai (1959) showed that ev…

math.CO2020★ 1 cited

Maximizing the number of independent sets of fixed size in $K_{n}$ -covered graphs

Anyao Wang, Xinmin Hou, Boyuan Liu +1

A graph $G$ is $H$ -covered by some given graph $H$ if each vertex in $G$ is contained in a copy of $H$ . In this note, we give the maximum number of independent sets of size $t\ge 3…

math.CO2020

Exact minimum codegree thresholds for $K_{4}^{-}$ -covering and $K_{5}^{-}$ -covering

Lei Yu, Xinmin Hou, Boyuan Liu +1

Given two $3$ -graphs $F$ and $H$ , an $F$ -covering of $H$ is a collection of copies of $F$ in $H$ such that each vertex of $H$ is contained in at least one copy of them. Let {$c_2(n…

math.CO2020

Minimizing the number of edges in $C_{\geq r}$ -saturated graphs

Yue Ma, Xinmin Hou, Doudou Hei +1

Given a family of graphs $F$ , a graph $G$ is said to be $F$ -saturated if $G$ does not contain a copy of $F$ as a subgraph for any $F \in F$ but the addi…

A Multi-View Low-Latency Direction-Sensing for Low-Altitude Network via a Multi-Armed Array

Tight lower bound for the spectral radius of connected graphs with given matching number

Ramsey numbers of color critical graphs versus large generalized fans

The degree threshold for covering with all the connected 3-graphs with 3 edges

Multicolor Ramsey numbers on stars versus pat

Graphs without rainbow cliques of orders four and five

On Induced Subgraph of Cartesian Product of Paths

Spectral extrema of graphs with bounded clique number and matching number

Generalized Turán problem with bounded matching number

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

The cycle of length four is strictly F-Turán-good

An Improved Probability Propagation Algorithm for Density Peak Clustering Based on Natural Nearest Neighborhood

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

Maximal fractional cross-intersecting families

Some exact results of the generalized Turán numbers for paths

Rainbow independent sets in graphs with maximum degree two

Strongly connected orientation with minimum lexicographic order of indegrees

The Turán number for the edge blow-up of trees

A Dirac-type theorem for uniform hypergraphs

Maximizing the number of independent sets of fixed size in Kn​-covered graphs

Exact minimum codegree thresholds for K4−​-covering and K5−​-covering

Minimizing the number of edges in C≥r​-saturated graphs

The degree threshold for covering with all the connected $3$ -graphs with $3$ edges

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

The cycle of length four is strictly $F$ -Turán-good

Maximizing the number of independent sets of fixed size in $K_{n}$ -covered graphs

Exact minimum codegree thresholds for $K_{4}^{-}$ -covering and $K_{5}^{-}$ -covering

Minimizing the number of edges in $C_{\geq r}$ -saturated graphs