题目一：Linear Arboricity of Digraphs

内容简介：A linear directed forest is a directed graph in which every component is a directed path. The linear arboricity $la(D)$ of a digraph $D$ is the minimum number of linear directed forests in $D$ whose union covers all arcs of $D$. For every $d$-regular digraph $D$, Nakayama and P/'{e}roche conjecture that $la(D)=d+1$. In this talk, we will present several results about the linear arboricity for complete symmetric digraphs, regular digraphs with high directed girth and random regular digraphs. Moreover, we will propose a more precise conjecture about the linear arboricity for digraphs.

报告人：广东工业大学   何伟骅   副教授

题目二：Typical structure of oriented graphs and digraphs with forbidden blow-up transitive triangle

内容简介：In this work, we establish an analogue result of the Erd/"os-Stone theorem of weighted digraphs using Regularity Lemma of digraphs. We give a stability result of oriented graphs and digraphs with forbidden blow-up transitive triangle and show that almost all oriented graphs and almost all digraphs with forbidden blow-up transitive triangle are almost bipartite respectively.

报告人：广东外语外贸大学   刘建熙   教授

时  间：2018年10月10日（周三）下午14：30始

地  点：南海楼224室

热烈欢迎广大师生参加!

信息科学技术学院/网络空间安全学院

2018年10月8日