删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

湖南大学数学学院导师教师师资介绍简介-彭岳建

本站小编 Free考研考试/2021-08-18

姓名:
彭岳建


学历/学位:
博士

职称:
教授

Email:
ypeng1@hnu.edu.cn

电话:


办公室:






学习经历

Emory University, 数学博士, 1996-2001
复旦大学, 数学硕士, 1989-1992
湘潭大学, 数学学士, 1985-1989

工作经历

湖南大学,数学所,教授,2012-
Indiana State University, 数学与计算机科学系, 历任助理教授,副教授, 教授 (终身), 2002-2012
Chatham College, 数学系, Assistant Professor, 2001-2002
湖南大学, 应用数学系, 讲师, 1992-1996

主要论文著作

[1] Y. Peng, V. Rodl and A.Rucinski, Holes in graphs,The Electronic Journal of CombinatoricsVolume 9(1) (2002), R1.
[2] Y. Peng, V. Rodl and J. Skokan, Counting small cliques in 3-uniform hypegraphs ,Combinatorics, Probability and ComputingVolume 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. A113 (2006), no.1, 67-83.
[4] Y. Peng, Using Lagrangians of hypergrpahs to find non-jumping numbers II,Discrete Mathematics307 (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 Combinatorics12 (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.

科研项目

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


相关话题/数学学院 湖南大学