姓名：田方
英文名：Tian, Fang
职称：副教授
办公电话：021-65902471
研究方向：图论及其应用，侧重图结构中随机方法，随机图过程，极值图论及相关应用研究
E-mail：tianf@mail.shufe.edu.cn
学习经历：
1996-2003 本硕哈尔滨师范大学基础数学专业
2003-2006 博士中国科学技术大学应用数学专业
工作经历：
2006.07-至今上海财经大学数学学院
学术交流经历：
2013.08-2014.08 Department of Mathematics, University of South Carolina- Columbia
2014.04-2014.07 Department of Mathematics, University of Wisconsin-Madison
2018.03-2019.03 Research School of Computer Science, Australian National University
获奖情况：曾获上海财经大学我心目中的好老师，校先进工作者，教书育人标兵提名奖等
参与科研项目：
上海市优秀青年教师科研专项基金-项目管理网络性能组合分析（2008.1-2009.12)
国家自然科学基金青年基金-随机方法在图分割及相关优化问题中的理论与算法应用研究(2012.1-2014.12)
校级基本科研业务费项目-随机图中禁用子图极值问题及其应用研究 (2017.1-2017.12)
国家自然科学基金面上项目-极值图论随机结构与概率方法(2019.1-2022.12)
国家自然科学基金面上项目-子图渐近计数，分布，阀值及相关问题(2021.1-2024.12)
代表论著：
ØFang Tian, Yiting Yang, A note on the random triadic process, Discrete Mathematics. 348(2025), Article number:114374
Ø Fang Tian, Zi-Long Liu, Xiang-Feng Pan, On the random greedy linear uniform hypergraph packing, Australasian Journal of Combinatorics, 87(3) (2023), 365-390.
Ø Fang Tian, Connectivity of the linear hypergraph process. Discrete Mathematics. 345（2022）Article number:113056.
Ø Fang Tian, On the number of linear multipartite hypergraphs with given size. Graphs and Combinatorics. 37（2021）, 2487-2496.
Ø B.D. McKay, Fang Tian, Asymptotic enumeration of linear hypergraphs with given number of vertices and edges. Advances in Applied Mathematics. 115 (2020), Article number:102000.
ØZi-Long Liu, Fang Tian, Some rainbow cycles in r-good edge-colorings. Applied Mathematics and Computation. 362 (2019), Article number:124566.
ØFang Tian, Zi-Long Liu, Bounding the independence number in some (n,k,l,λ) hypergraphs. Graphs and Combinatorics. 34（2018），845-861.
ØFang Tian, On Distance Matching Number in a Class of Sparse Random Graphs. Advances in Mathematics(China). 47(2) (2018), 175-181.
ØFang Tian, Zi-Long Liu, Improved approximating 2-CatSP for σ≤0.5 with an unbalanced rounding matrix. Journal of Industrial and Management Optimization. 12 (4) (2016), 1249-1265.
ØFang Tian, Zi-Long Liu, Lower Bounds on some certain vander Waerden Functions. Ars Combinatoria. 116 (2014), 55-63.
ØFang Tian, Zi-Long Liu, Probabilistic single obnoxious facility location with fixed budget. Information Processing Letters. 112(2012),115-119.
ØFang Tian, Zi-Long Liu, Simple probabilistic analysis to generalize bottleneck graph multi-partitioning. Applied Mathematics Letters.25(12)(2012),2040-2046.
ØZi-Long Liu, Fang Tian and Jun-Ming Xu, Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs. Theoretical Computer Science. 410 (2009), 3804-3813.
ØFang Tian, Jun-MingXu, Average Distances and Distance Domination Numbers. Discrete Applied Mathematics. 157 (5) (2009), 1113–1127.
ØFang Tian,Jun-Ming Xu, A Note on Distance Domination Numbers of Graphs. Australasian Journal of Combinatorics. 43(2009), 181-190.
ØFang Tian,Jun-Ming Xu, Distance Domination-Critical Graphs. Applied Mathematics Letters. 21 (4)(2008), 416–420.
ØFang Tian,Jun-Ming Xu, On distance connected domination numbers of graphs. Ars Combinatoria. 84(2007), 357-367.
ØJun-MingXu, Fang Tian and Jia Huang, Distance irredundance and connected domination numbers of a graph. Discrete Mathematics, 306 (22) (2006), 2943-2953.
ØFang Tian,Jun-Ming Xu, Distance domination numbers of generalized de Bruijn and Kautz digraphs. OR.Transactions.10(1) (2006), 88-94.