Zhi-Hong Sun

activity

20102026

most citedCongruences concerning Legendre polynomials

47 citations · 109 across the 54 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2014★ 1 cited

Turán's problem for trees $T_{n}$ with maximal degree $n - 4$

Zhi-Hong Sun, Yin-Yin Tu

For $n \geq 6$ let $V = {v_{0}, v_{1}, \dots, v_{n - 1}}$ , $E_{1} = {v_{0} v_{1}, \dots, v_{0} v_{n - 4}, v_{1} v_{n - 3}, v_{1} v_{n - 2}$ , $v_{1} v_{n - 1}}$ , $E_2=\{v_0v_1,\ldots,v_0v_{n-4},v_1v_{n-3},v_1v_{n-2},v_2v_…

math.CO2014

Ramsey numbers for trees II

Zhi-Hong Sun

Let $r (G_{1}, G_{2})$ be the Ramsey number of the two graphs $G_{1}$ and $G_{2}$ . For $n_{1} \geq n_{2} \geq 1$ let $S (n_{1}, n_{2})$ be the double star given by $V(S(n_1,n_2))=\{v_0,v_1,\ldots,v_{n_1}…

math.CO2014

On the properties of even and odd sequences

Zhi-Hong Sun

In this paper we continue to investigate the properties of those sequences ${a_{n}}$ satisfying the condition $\sum_{k = 0}^{n} (k n) (- 1)^{k} a_{k} = \pm a_{n}$ $(n \geq 0)$ . As applications w…

math.CO2013★ 3 cited

Inequalities for binomial coefficients

Zhi-Hong Sun

In this paper we prove several inequalities for binomial coefficients. For instance, if $k$ and $n$ are positive integers such that $n \geq 400$ and $[\frac{n}{5}] \leq k \leq [\frac{n}{2}]$ ,…

math.CO2013★ 1 cited

On the properties of a sequence concerning binomial coefficients

Daeyeoul Kim, Ayyadurai Sankaranarayanan, Zhi-Hong Sun

For $n \geq 3$ let $f (n)$ be the least positive integer $k$ such that $(k n) > \frac{2 ^{n}}{n + 1}$ . In this paper we investigate the properties of $f (n)$ .

math.CO2011★ 2 cited

Turán's problem and Ramsey numbers for trees

Zhi-Hong Sun, Lin-Lin Wang, Yi-Li Wu

Let $T_{n}^{1} = (V, E_{1})$ and $T_{n}^{2} = (V, E_{2})$ be the trees on $n$ vertices with $V = {v_{0}, v_{1}, \dots, v_{n - 1}}$ , $E_{1} = {v_{0} v_{1}, \dots, v_{0} v_{n - 3}, v_{n - 4} v_{n - 2}, v_{n - 3} v_{n - 1}}$ , and $E_2…

math.CO2011

Turán's problem and generalized Ramsey numbers

Zhi-Hong Sun

Let $n, r, k, s$ be positive integers with $n, k \geq 2$ . The generalized Ramsey number $R (n, r; k, s)$ is the smallest positive integer $p$ such that for every graph $G$ of order $p$ , eith…

math.CO2010

Some inversion formulas and formulas for Stirling numbers

Zhi-Hong Sun

In the paper we present some new inversion formulas and two new formulas for Stirling numbers.

Turán's problem for trees Tn​ with maximal degree n−4

Ramsey numbers for trees II

On the properties of even and odd sequences

Inequalities for binomial coefficients

On the properties of a sequence concerning binomial coefficients

Turán's problem and Ramsey numbers for trees

Turán's problem and generalized Ramsey numbers

Some inversion formulas and formulas for Stirling numbers

Turán's problem for trees $T_{n}$ with maximal degree $n - 4$