学习与工作经历
2003年-2005年,西北工业大学自动化学院,自动控制专业,在读
2005年-2008年,西北工业大学数学系,应用数学,学士
2008年-2011年,福州大学离散数学中心,应用数学,硕士
2011年-2015年,西北工业大学数学系,应用数学,博士
2015年-2020年,天津大学数学学院,讲师
2017.12-2018.6,新加坡南洋理工大学,访问学者
2020年——至今,南开大学计算机学院/网络空间安全学院,副教授
——————————————————————————————————————————
讲授课程
- 2020/09- 2021/ 01/14: 研究生数学基础(研究生课程),南开大学
- 2021/10-2022/01:线性代数(本科生),南开大学
- 2022/03- : 信息论(密码专业本科生),南开大学
————————————————————————————————————————————————
投稿和准备论文
- Jie Ma, Bo Ning, Hehui Wu, Longest cycles in highly-connected graphs, in preparation.
- Bo Ning, Long-tu Yuan, Stability in Bondy’s theorem on paths and cycles, in preprint.
- Bo Ning, Mingqing Zhai, Counting substructures and eigenvalues I: triangles, submitted.
- Binlong Li, Bo Ning, Eigenvalues and cycles of consecutive lengths, submitted, arXiv:2110.05670 .
————————————————————————————————————————————————
发表论文 (数学类论文严格字母排序):
一、图论方向论文 (Selected Papers)
- Binlong Li, Jie Ma, Bo Ning*, Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles, J. Combin. Theory Ser. B 152(2022)399--414. Journal Version.
- Binlong Li, Bo Ning*, Exact bipartite Turán numbers of large even cycles, J. Graph Theory, 97 (2021), no.4, 642--656. Journal Version.
- Huiqiu Lin, Bo Ning*, A complete solution to the Cvetkovic-Rowlinson Conjecture, J. Graph Theory 97 (2021), no.3, 441--450. Journal Version.
- Huiqiu Lin, Bo Ning*, Baoyindureng Wu, Eigenvalues and triangles in graphs. Combin. Probab. Comput. 30 (2021), no.2, 258-270. Journal Version.
- Fengming Dong*, Jun Ge, Helin Gong, Bo Ning, Zhangdong Ouyang, Eng Guan Tay, Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations, J. Graph Theory 96 (2021), no.3, 343--360. Journal Version.
- Binlong Li, Bo Ning*, A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture. J. Combin. Theory Ser. B 146 (2021), 76--95. Journal Version.
- Jie Ma, Bo Ning, Stability Results on the Circumference of a Graph. Combinatorica 40 (2020), no.1, 105-147. Journal Version.
- Bo Ning, Xing Peng, Extensions of the Erdős-Gallai theorem and Luo's theorem. Combin. Probab. Comput. 29 (2020), no. 1, 128-136. Journal Version.
- Hongliang Lu, Bo Ning*, An Ore-type condition for large k -factor and disjoint perfect matchings. J. Graph Theory 94 (2020), no. 3, 307-319. Journal Version.
- Jie Ma, Bo Ning, Coloring graphs with two odd cycle lengths. SIAM J. Discrete Math. 32(2018), no.1, 296-319.
————————————————————————————————————————————
荣誉/邀请报告
- 华人数学家大会45分钟邀请报告(ICCM) , 2022.
- 中国数学会年会邀请报告,2019.
- 北洋学者青年骨干教师计划(天津大学),2017.
————————————————————————————————————————————
随笔
- 谱图兰型问题的研究进展,宁博,柚子优化(微信公众号),2021-04-09.
————————————————————————————————————————————
有用的资料
- 张克明,某些图论问题的进展,数学研究与评论,2007年,第27卷第3期,563--576.
- Fan Chung, Graph theory in the information age. Notices Amer. Math. Soc. 57 (2010), no. 6, 726–732.
- Zoltán, Füredi; Miklós, Simonovits, The history of degenerate (bipartite) extremal graph problems. Erdös centennial, 169–264, Bolyai Soc. Math. Stud., 25, János Bolyai Math. Soc., Budapest, 2013.
- Hao, Li, Generalizations of Dirac's theorem in Hamiltonian graph theory—a survey. Discrete Math. 313(2013), no. 19, 2034–2053.
- Adrian, Bondy, Beautiful conjectures in graph theory. European J. Combin. 37 (2014), 4–23.
- Jacques, Verstraete, Extremal problems for cycles in graphs. Recent trends in combinatorics, 83–116, IMA Vol. Math. Appl. 159,Springer, [Cham], 2016.