Jun-ming Gao

activity

20162023

most citedA strengthening on odd cycles in graphs of given chromatic number

2 citations · 5 across the 13 of their papers we have counts for

collaborators

Showing 2017 · math.COShow all

2 papers · 2 filters

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★ 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

The spectral radius of graphs without long cycles

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