首页   系科介绍   师资队伍   科研团队   本科生教学   研究生培养   招聘信息   联系我们

Previous Next
 
首页 >> 学术报告

Independent Sets in Hypergraphs

Dhruv Mubayi 教授(美国University of Ilinois at Chicago数学系)
2014年5月27日(周二) 10:00-11:00  闵行校区数学楼102室
 
摘要: The problem of determining the independence number of (hyper)graphs has tight connections to questions in discrete geometry, coding theory, number theory, theoretical computer science and combinatorics. One of the most famous early examples is the result of Komlos-Pintz-Szemeredi from 1982 on the independence number of 3-uniform hypergraphs which made important progress on the decades old Heilbronn problem. I will begin by explaining this result and some of these connections. I Will then describe recent work in this area which shows that hypergraphs have a significantly different behaviow than graphs when it comes to independent sets. This answers a question posed by Ajtai-Erdow-Komlos-Szemeredi (1981), and disproves conjectures of deCaen (1986),Frieze and the speaker (2007), and several others.

报告人简介:Dhruv Mubayi 是美国University of Ilinois at Chicago数学系教授,是国际组合图论界知名专家。他是五本著名期刊的编辑,包括Journal of Combinatorial Theory (B)、Journal of Combinatorial Theory (A)、SIAM Journal on Discrete Mathematics组合图论界顶尖期刊。
   
 
 
快捷链接 >>
 
系内资源 >>
 
教学园地 >>
 
  校外链接 >>    上海市核心数学与基础数学重点实验室    华师大-纽大联合数学中心    上海市数学会    中国数学会    美国数学会    欧洲数学会  
         
       Copyright 2012 All rights reserved    Department of Mathematics, East China Normal University    Tel: 86-21-54342609