报告题目：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}$, denoted by $ex_r(n, \mathcal{F})$, is the maximum number of hyperedges in an $\mathcal{F}$-free $n$-vertex $r$-uniform hypergraph. Our current results are motivated by earlier results on Tur\’{a}n numbers of star forests and hypergraph star forests. In particular, Lidick\’{y} et al. (2013) determined the Tur\’{a}n number $ex(n, F)$ of a star forest $F$ for sufficiently large n. Recently, Khormali and Palmer (2022) generalized the above result to three different well-studied hypergraph settings (the expansions of a graph, linear hypergraphs and Berge hypergraphs), but restricted to the case that all stars in the hypergraph star forests are identical. We further generalize these results to general star forests in hypergraphs.
张林朋，西北工业大学博士生，导师为王力工教授，荷兰特文特大学（University of Twente）联合培养，导师为Hajo Broersma教授，研究兴趣为超图Turan问题。
