Jun-ming Gao

most citedThe spectral radius of graphs without long cycles

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

collaborators

3 papers

math.CO2019

A conjecture of Verstraëte on vertex-disjoint cycles

Jun Gao, Jie Ma

Answering a question of Häggkvist and Scott, Verstraëte proved that every sufficiently large graph with average degree at least $k^{2} + 19 k + 10$ contains $k$ vertex-disjoint cycles of…

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…

A conjecture of Verstraëte on vertex-disjoint cycles

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