当前位置: 首页 / English / Academics / 正文

Codegree Tur\'an density and independence number of hypergraphs

作者:   时间:2019-05-21   点击数:

Title: Codegree Tur\'an density and independence number of hypergraphs

Presenter: Zhao Yi

Abstract: Tur\'an number and independence number are two fundamental parameters of graphs. We only have limited knowledge of them in hypergraphs. In a joint work with Allan Lo (University of Birmingham, UK), we gave the best bounds for the codegree Tur\'an density of complete r-uniform hypergraphs. In a recent joint work with Marcelo Sales and Vojtech Rodl (Emory University, USA), we obtain a new bound for independence number of 4-uniform hypergraphs under maximum degree conditions. I will discuss the connection and proofs of these and other related results.

Presenter Introduction: Zhao Yi, Department of Mathematics & Statistics of Georgia State University, Professor.

Inviter: Wang Guanghui, Professor of School of Mathematics

Time: 9:00, May 30 (Thursday)

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

Hosted by: School of Mathematics, Shandong University

 

地址:中国山东省济南市山大南路27号   邮编:250100  

电话:0531-88364652  院长信箱:sxyuanzhang@sdu.edu.cn

Copyright@ m6体育入口(上海)贸易公司

微信公众号