Xinmin Hou

activity

20162020

most citedMaximizing the number of independent sets of fixed size in

K_{n}

-covered graphs

1 citations · 3 across the 8 of their papers we have counts for

collaborators

8 papers

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

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.CO2019

The score sequences with unique tournament that has minimum number of upsets

Yuming Zhang, Xinmin Hou

Let $T$ be a tournament with nondecreasing score sequence $R$ and $A$ be its tournament matrix. An upset of $T$ corresponds to an entry above the main diagonal of $A$ . Given a feas…

math.CO2019

An Erdős-Gallai-type theorem for keyrings with larger number of leaves

Xinmin Hou, Xiaodong Xue

A keyring is a graph obtained from a cycle by appending $r \geq 0$ leaves to one of its vertices. Sidorenko proved an Erdős-Gallai-type theorem: Every graph of order $n$ and size more…

math.CO2019★ 1 cited

Minimum degree of 3-graphs without long linear paths

Yue Ma, Xinmin Hou, Jun Gao

A well known theorem in graph theory states that every graph $G$ on $n$ vertices and minimum degree at least $d$ contains a path of length at least $d$ , and if $G$ is connected and…