11-21【陆 玫】 腾讯会议 吴文俊数学重点实验室组合图论系列讲座之160

发布者:万宏艳发布时间:2020-11-17浏览次数:250

题目:Rainbow Independent Sets in Cycles 


报告人:陆玫 教授(清华大学)


时间:2020年11月21号上午9:00-10:00


地点: 腾讯会议: 429 906 871 密码:123456


摘要:For a given class ${\cal C}$ of graphs and given integers $m \le n$, let $f_{\cal C}(n,m)$ be the minimal number $k$ such that every $k$ independent $n$-sets in any graph belonging to ${\cal C}$ have a (possibly partial) rainbow independent $m$-set. In this talk, I will give our result about rainbow independent sets on the case ${\cal C}=\{C_{2s+1}\}$. Our result is a special case of the conjecture (Conjecture 2.9) proposed by Aharoni et al. This talk is based on the work jointed with Zequn Lv.