题目：Rainbow Ramsey Number for Posets
报告人：李渭天 教授 （台湾中兴大学）
时间：12月21日 周五下午 3:00-4:00
地点：致远楼 101室
Abstract：We address the following rainbow Ramsey problem: For posets P, Q what is the smallest number n such that any coloring of the elements of the Boolean lattice Bn either admits a monochromatic copy of PP or a rainbow copy of QQ. We consider both weak and strong (non-induced and induced) versions of this problem.
欢迎各位参加！
会议室预约入口
"智能计算与应用"同济大学数学中心
English
官方微信