Yong-Gao Chen

activity

20052025

most citedOn a problem of Nathanson

15 citations · 60 across the 23 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2013

A lower bound of the least signless Laplacian eigenvalue of a graph

Shu-Guang Guo, Yong-Gao Chen, Guanglong Yu

Let $G$ be a simple connected graph on $n$ vertices and $m$ edges. In [Linear Algebra Appl. 435 (2011) 2570-2584], Lima et al. posed the following conjecture on the least eigenvalu…

math.CO2011

On a Problem of Erdős, Herzog and Schönheim

Yong-Gao Chen, Cui-Ying Hu

Let $p_{1}, p_{2}, ..., p_{n}$ be distinct primes. In 1970, Erd\H os, Herzog and Schönheim proved that if $D$ is a set of divisors of $N = p_{1}^{α_{1}} ... p_{n}^{α_{n}}$ , $α_1\ge α_2\ge...\ge…