报告题目：The size and structure of maximal d-wise intersecting families and cross-intersecting families主讲人：张孟龙报告时间：10月19日 11:20-11:50报告地点：西安电子科技大学南校区会议中心B101报告厅For a positive integer , a family  is said to be -wise intersecting if for all . A -wise intersecting family is called maximal if is not -wise intersecting for any . This talk provides a refinement of ...

报告题目：Turan numbers of general star forests in hypergraphs主讲人：张林朋报告时间：10月19日 10:50-11:20报告地点：西安电子科技大学南校区会议中心B101报告厅Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs, and let $H$ be an $r$-uniform hypergraph. Then $H$ is called $\mathcal{F}$-free if it does not contain any member of $\mathcal{F}$ as a subhypergraph. The Tur\’{a}n number of $\mathcal{F}...

报告题目：Neighborhood conditions for hamiltonicity of K1,4-free graphs主讲人：尚王毅报告时间：10月19日 10:00-10:30报告地点：西安电子科技大学南校区会议中心B101报告厅In this talk, we focus on extending a sufficient neighborhood condition for hamiltonicity of claw-free graphs due to Asratian, Broersma, Van den Heuvel and Veldman to $K_{1,4}$-free graphs. Let $k$, with $2\leq k\leq 3$, be an integer. ...

报告题目：On the stability of chromatic thresholds主讲人：薛益赛报告时间：10月19日 9:30-10:00报告地点：西安电子科技大学南校区会议中心B101报告厅The chromatic threshold of  a graph  is the infimum of   such that there exists a constant   depending only on   and  , for which the chromatic number of every  -vertex   -free graph with minimum degree at least   is bounded by . Allen, B  ttcher, Griffiths,...