当前位置: 首页  科学研究  学术交流  学术报告

数学学科离散数学研究所学术报告(Patrice Ossona De Mendez 法国科学社会数学与分析中心 研究员)

发布者:戴 情   发布时间:2021-11-30  浏览次数:115

报告题目:Gentle graphs (II)

 告 人:Patrice Ossona De Mende法国科学社会数学与分析中心 研究员

报告时间:2021年12月3日16:30-17:30

报告地点:Zoom,会议ID: 861 3902 5318,密码: 387940

摘要:Not all graphs have the same complexity. Depending on the problem, one may prefer sufciently random graphs or highly structured graphs, dense graphs or sparse graphs. Several complexity measures are known for sparse graphs, degeneracy being a prime example. In this talk, I will present some works aiming to define an analogue to degeneracy for dense graphs.

 

邀请人:朱绪鼎