Xinmin Hou

activity

20152026

K_{4}^{-}

-saturated graphs

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

collaborators

Showing 2020Show all

5 papers · 1 filter

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…

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

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