丁来浩 English Version (英文版)
职称讲师
办公室6号楼M522
邮箱dinglaihao@mail.ccnu.edu.cn


个人简介
丁来浩，讲师，硕士生导师

开设课程
概率统计、线性代数、运筹学基础、图论

研究方向
图染色理论、极值图论

教育经历
2012.9–2018.6, 山东大学, 运筹学与控制论, 博士2016.9–2017.9, 佐治亚理工学院，数学学院, 联合培养博士2008.9–2012.6, 山东大学, 信息与计算科学, 学士

工作经历
2018.7-至今, 华中师范大学, 数学与统计学学院, 讲师2018.7-至今, 华中师范大学, 数学与统计学学院，师资博士后

研究成果
投稿论文：1.Laihao Ding; Jie Hu; Guanghui Wang; Donglei Yang*, Properly colored short cycles in edge-colored graphs, submitted to European Journal of Combinatorics.2.Laihao Ding; Jie Han*; Shumin Sun; Guanghui Wang; Wenling Zhou, F-factors in weakly quasi-random hypergraphs, submitted to Journal of The London Mathematical Society.发表论文：1.Xiaohan Cheng; Laihao Ding*; Guanghui Wang; Jianliang Wu, Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs, Discrete Mathematics, 2020 343: 111856.2.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.3.Laihao Ding; Guanghui Wang*; Jianliang Wu, Generalized acyclic edge colorings via entropy compression, Journal of Combinatorial Optimization, 2018 35(3): 906-920. 4.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.5.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.6.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.7.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. 8.Hualong Li; Laihao Ding; Bingqiang Liu; Guanghui Wang*, Neighbor sumdistinguishing total colorings of planar graphs, Journal of Combinatorial Optimization, 2015 30(3): 675-688.9.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，国家自然科学基金面上项目，图填装和点不交的子图问题，参加

附件