Xinmin Hou

activity

20152026

K_{4}^{-}

-saturated graphs

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

collaborators

Showing 2019Show all

3 papers · 1 filter

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…