Xinmin Hou

activity

20152026

K_{4}^{-}

-saturated graphs

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

collaborators

Showing 2022Show all

7 papers · 1 filter

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…

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

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