Xinmin Hou

activity

20152026

K_{4}^{-}

-saturated graphs

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

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

The size of $3$ -uniform hypergraphs with given matching number and codegree

Xinmin Hou, Lei Yu, Jun Gao +1

Determine the size of $r$ -graphs with given graph parameters is an interesting problem. Chvátal and Hanson (JCTB, 1976) gave a tight upper bound of the size of 2-graphs with restri…

math.CO2017

Odd induced subgraphs in graphs with treewidth at most two

Xinmin Hou, Lei Yu, Jiaao Li +1

A long-standing conjecture asserts that there exists a constant $c > 0$ such that every graph of order $n$ without isolated vertices contains an induced subgraph of order at least $c…

math.CO2017★ 2 cited

The spectral radius of graphs without long cycles

Jun Gao, Xinmin Hou

Nikiforov conjectured that for a given integer $k \geq 2$ , any graph $G$ of sufficiently large order $n$ with spectral radius $μ (G) \geq μ (S_{n, k})$ (or $μ (G) \geq μ (S_{n, k}^{+}))$ contai…

The size of 3-uniform hypergraphs with given matching number and codegree

Odd induced subgraphs in graphs with treewidth at most two

The spectral radius of graphs without long cycles

The size of $3$ -uniform hypergraphs with given matching number and codegree