Lin-Lin Wang

activity

20102014

most citedTurán's Problem for Trees

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

collaborators

3 papers

math.CO2014★ 2 cited

Turán's Problem for Trees

Zhi-Hong Sun, Lin-Lin Wang

For a forbidden graph $L$ , let $e x (p; L)$ denote the maximal number of edges in a simple graph of order $p$ not containing $L$ . Let $T_{n}$ denote the unique tree on $n$ vertices with…

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.NT2010

An extension of Stern's congruence

Zhi-Hong Sun, Lin-Lin Wang

Let ${E_{n}}$ be the Euler numbers. In the paper we determine $E_{2^{m} k + b} - E_{b}$ modulo $2^{m + 7}$ , where $k$ and $m$ are positive integers and $b \in 0, 2, 4, ...$ .