Title: The treewidth of corresponding graphs

Keynote Speaker: Lu Mei

Abstract: Let $H=(V,F)$ be a hypergraph. The corresponding graph of $H$, denoted by $C(H)$, is a graph with $V(C(H))=V$ and for any $ u,v\in V(C(H))$, $uv\in E(C(H))$ if and only if there is $ f\in F$ such that $u,v\in f$. The treewidth of a graph is an important invariant in structural and algorithmic graph theory. In this talk, we consider the treewidth of the corresponding graphs of hypergraphs. Some results on the bounds of the treewidth of corresponding graphs will be given.

Speaker Introduction: Lu Mei received her Doctor of Science from the Academy of Mathematics and Systems Science, Chinese Academy of Sciences in July 1993. She is currently a professor and doctoral supervisor in the Department of Mathematical Sciences of Tsinghua University, and mainly studies operations research, graphing & optimal grouping. In addition, she has published more than 70 academic papers in SCI search source journals. She is currently the director of the Institute of Computational Mathematics and Operations Research, Department of Mathematical Sciences, Tsinghua University.

Inviter: Wu Jianliang, professor of School of Mathematics

Time: 15:00, May 16 (Thursday)

Location: Hall 924, Block B, Zhixin Building, Central Campus

Hosted by: School of Mathematics, Shandong University