丁来浩-华中师范大学数学学院中文站

个人简介

丁来浩，副教授，硕士生导师

开设课程

本科生课程：高等代数、概率统计、线性代数、运筹学基础、图论
研究生课程：网络优化

研究方向

图染色理论、极值图论

教育经历

2012.09–2018.06，山东大学，运筹学与控制论，博士
2016.09–2017.09，佐治亚理工学院，数学学院，联合培养博士
2008.09–2012.06，山东大学，信息与计算科学，学士

工作经历

2023.07至今，       华中师范大学，数学与统计学学院，副教授
2023.10-2024.08，韩国基础科学研究院，访问学者
2018.07-2023.07，华中师范大学，数学与统计学学院，讲师/师资博后

研究成果

1.	Laihao Ding; Ander Lamaison; Hong Liu; Shuaichao Wang; Haotian Yang, On 3-graphs with vanishing codegree Turan density, Journal of The London Mathematical Society (2), 2025, DOI: 10.1112/jlms.70281.

2.	Csilla Bujtás; Akbar Davoodi; Laihao Ding; Ervin Gyori; Zsolt Tuza; Donglei Yang, Covering the edges of a graph with triangles, Discrete Mathematics, 2025, 348(1): 114226.

3.	Laihao Ding; Jie Han; Shumin Sun; Guanghui Wang; Wenling Zhou, Tiling multipartite hypergraphs in quasi-random hypergraphs, Journal of Combinatorial Theory, Series B, 2023, 160: 36-65.

4.	Laihao Ding; Jie Han; Shumin Sun; Guanghui Wang; Wenling Zhou, F-factors in weakly quasi-random hypergraphs, Journal of The London Mathematical Society (2), 2022, 106: 1810-1843.

5.	Laihao Ding; Jie Hu; Guanghui Wang; Donglei Yang, Properly colored short cycles in edge-colored graphs, European Journal of Combinatorics, 2022, 100: 103436.

6.	Xiaohan Cheng; Laihao Ding; Guanghui Wang; Jianliang Wu, Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs, Discrete Mathematics, 2020, 343: 111856.

7.	Laihao Ding; Guan-Huei Duh; Guanghui Wang; Tsai-Lien Wong; Jianliang Wu; Xiaowei Yu; Xuding Zhu, Graphs are (1,Δ+1)-choosable, Discrete Mathematics, 2019, 342(1): 279-284.

8.	Laihao Ding; Guanghui Wang; Jianliang Wu, Generalized acyclic edge colorings via entropy compression, Journal of Combinatorial Optimization, 2018 35(3): 906-920. 

9.	Xiaowei Yu ; Yuping Gao; Laihao Ding, Neighbor Sum Distinguishing Chromatic Index of Sparse Graphs via the Combinatorial Nullstellensatz, Acta Mathematicae Applicatae Sinica-English Series, 2018 34(1): 135-144.

10.	Laihao Ding; Guanghui Wang; Jianliang Wu; Jiguo Yu, Neighbor sum (set) distinguishing total choosability via the Combinatorial Nullstellensatz, Graphs and Combinatorics, 2017 33(4): 885-900.

11.	Jianghua Zhang; Laihao Ding; Guanghui Wang; Guiying Yan; Shan Zhou, Neighbor Sum Distinguishing Index of K4-Minor Free Graphs, Graphs and Combinatorics, 2016 32(4): 1621-1633.

12.	Cunquan Qu; Laihao Ding; Guanghui Wang; Guiying Yan, Neighbor distinguishing total choice number of sparse graphs via the Combinatorial Nullstellensatz, Acta Mathematicae Applicatae Sinica-English Series, 2016 32(2): 537-548. 

13.	Hualong Li; Laihao Ding; Bingqiang Liu; Guanghui Wang, Neighbor sum distinguishing total colorings of planar graphs, Journal of Combinatorial Optimization, 2015 30(3): 675-688.

14.	Laihao Ding; Guanghui Wang; Guiying Yan, Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz, Science China Mathematics, 2014 57(9): 1875-1882.

研究项目

1.2020/01-2022/12，国家自然科学基金青年项目，边染色图中彩虹匹配与染色圈的存在性研究，主持
2.2019/05-2021/07，中国博士后基金面上项目，色度条件下边染色圈的存在性与彩虹匹配的Turan问题，主持
3.2019/01-2022/12，国家自然科学基金面上项目，边染色图与有向图中的几类极值问题，参加
4.2017/01-2020/12，国家自然科学基金面上项目，图填装和点不交的子图问题，参加

附件

100元2小时不限次数电话号码,全国空降200元快餐联系方式,24小时微信快餐妹,全国同城约资源匹配系统

丁来浩

English Version (英文版)