蔡建生教授学术报告

报告题目：The extremal number of edges of Mixed-hypergraph

报告人:  蔡建生教授 （潍坊学院）

报告时间: 2019年11月16日（周六）下午15:00-16:00

报告地点: 数学院大会议室341

报告摘要：A mixed hypergraph is a triple $H=(X,C,D)$ where $X$ is called the vertex set, also denoted by $V(H)$, $C$ is the family of subsets of $X$ called $C$-edges, also denoted by $C(H)$, and $D$ is the family ofsubsets of $X$ called $D$-edges,also denoted by $D(H)$. For a hypergraph

$H=(X,C,D)$, the partial mixed hypergraph $H=(X,C,\emptyset)$, also denoted by $H_{c}=(X,C)$ is called a $C$-hypergraph. In this paper, we solve an open problem posed by Voloshin concerning the maximum number of hyperedges of an $r$-uniform $C$-hypergraph with given $\overline{\chi}(H)$.

报告人简介:

蔡建生，潍坊学院yl7703永利官网教授，理学博士，中国工业与应用数学学会图论组合及其应用专业委员会常务理事，中国运筹学会图论组合分会理事，山东数学会高等数学专业委员会常务理事。2010年以来主持和参加国家自然科学基金4项，山东省自然科学基金2项。主要研究领域是图论及组合数学、生物信息学。曾获山东省高等学校优秀科研成果奖。担任“International Journal of Digital Contents Technology and Its Applications”编委。发表相关学术论文50余篇，其中SCI收录40余篇。