• 姓名: 彭岳建
  • 职称: 教授
  • 学位: 博士
  • 湖南大学
  • 数学与计量经济学院
教育背景

1989年获湘潭大学学士学位;

1992年获复旦大学硕士学位;

2001年获美国Emory大学理学博士学位。

工作经历

2012:-至今:湖南大学数学所教授;

2001年后先后在美国Chatham大学,Indiana State University 任教, 并于2012年晋升Indiana State University 教授(终身)。

1992-1996:湖南大学应用数学系讲师。

学术兼职

美国数学评论的评论员和多家学术刊物的审稿人。

科研项目
1. 超图中的极值问题,11271116,国家自然科学基金面上项目, 2013/01-2016/12
论文专著

有多篇学术论文在国际顶尖学术刊物发表。

[1] Y. Peng, V. Rodl and A.Rucinski, Holes in graphs, The Electronic Journal of Combinatorics Volume 9(1) (2002), R1.

[2] Y. Peng, V. Rodl and J. Skokan, Counting small cliques in 3-uniform hypegraphs , Combinatorics, Probability and Computing Volume 14 (2005), 371-413.

[3] P. Haxell, T. L uczak, Y. Peng, V. Rodl, A. Rucinski, M. Simonovits and J. Skokan, The Ramsey number for hypergraph cycles I, Journal of Combinatorial Theory Ser. A 113 (2006), no.1, 67-83.

[4] Y. Peng, Using Lagrangians of hypergrpahs to find non-jumping numbers II, Discrete Mathematics 307 (2007), 1754-1766.

[5] P. Frankl, Y. Peng, V. Rodl and J. Talbot, A note on the jumping constant conjecture of Erdos, Journal of Combinatorial Theory Ser. B. 97 (2007), 204-216.

[6] Y. Peng, Using Lagrangians of hypergrpahs to find non-jumping numbers I, Annals of Combinatorics 12 (2008), no. 3, 307-324.

[7] P. Haxell, T. L uczak, Y.Peng, V. Rodl, A. Rucinski and J. Skokan, The Ramsey number for 3-uniform tight hypergraph cycles , Combin. Probab. Compt. 18 (2009), no. 1-2, 165-203.

[8]Y. Peng, P.Sissokho, C.Zhao, An extremal problem for set families generated with the union and symmetric difference operations, Journal of combinatorics 3(2012), 651-668.

[9] Y. Peng, K.P.S.B. Rao, On Zumkeller numbers, Journal of number theory 133(2013) 1135-1155.

[10]Y. Peng, H.Peng, Q. S. Tang, C. Zhao, An extension of the Motzkin–Straus theorem on on-uniform hypergraphs and its applications, Discrete Applied Mathematics 200 (2016) , 170–175.