題目一：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室

熱烈歡迎廣大師生參加!

太阳集团1088vip/網絡空間安全學院

2018年10月8日