On the chromatic number of structured Cayley graphs

LIST

모드선택 :              
세미나 신청은 모드에서 세미나실 사용여부를 먼저 확인하세요

On the chromatic number of structured Cayley graphs

수리과학부 0 523
구분
일정 2016-12-12(월) 16:00~17:00
세미나실 129동 301호
강연자 Keivan Mallahi-Karai (Jacobs University)
담당교수 임선희
기타
The famous Hadwider-Nielson problem asks for the smallest number $n$ such that the points of the plane can be partitioned into $n$ sets such that no two points in the same set are at distance $1$. This problem, among many similar problems, can be reformulated in terms of the chromatic number of certain Cayley graphs. In this talk, I will discuss two recent results in this direction: one pertains to the Borel chromatic number of the unit-distance graph associated to quadratic forms over local fields. The other result is a lower bound on the chromatic number of Cayley graphs of finite groups of Lie type.
    정원 :
    부속시설 :
세미나명