素数阶循环图和经典Ramsey数R（4，n）的三个新下界

研究了素数阶循环圈的基本性质，提出了寻求有效参数构造正则循环圈的新方法，得到了3个经典Ramsey数的新下界：R（4，17）≥164，R（4，18）≥182，R（4，22）≥282．这前2个结果填补了关于Ramsey数综述[2]的上下界表中的2个空白，第3个结果超过了目前已知的最好下界R（4，22）≥258，     

Weight enumerators of reducible cyclic codes and their dual codes

Let ${\mathbb{F}}_q$ be a finite field and $n$ a positive integer. In this paper, we find a new combinatorial method to determine weight enumerators of reducible cyclic codes and their dual codes of length $n$ over ${\mathbb{F}}_q$, which just generalize results of Zhu et al. (2015); especially, we also give the weight enumerator of a cyclic code, which is viewed as a partial Melas code. Furthermore, weight enumerators obtained in this paper are all in the form of power of a polynomial.     

On the Ramsey numbers R(3, 8) and R(3, 9)

Using methods developed by Graver and Yackel, and various computer algorithms, we show that 28 ≤ R(3, 8) ≤ 29, and R(3, 9) = 36, where R(k, l) is the classical Ramsey number for 2-coloring the edges of a complete graph.     

The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Given a graph $G$ we are interested in studying the symmetric matrices associated to $G$ with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees.