December 10–12, 2014
자연과학동(E6-1), KAIST
Preregistration in kcw2014.eventbrite.com deadline: Dec. 5 (Friday)
Program (Dec.10 Wed-Room 1409)
- 1:30-2:00 Registration
- 2:00-2:30 Young Soo Kwon (권영수), Yeungnam University: A variation of list coloring and its properties
- 2:40-3:10 Mitsugu Hirasaka, Pusan National University: Small topics on association schemes
- 3:10-3:40 Coffee Break
- 3:40-4:10 Younjin Kim (김연진), KAIST: On Extremal Combinatorial Problems of Noga Alon
- 4:20-4:50 Jang Soo Kim (김장수), Sungkyunkwan University: A new q-Selberg integral, Schur functions, and Young books
- 5:00-6:00 Discussion
- 6:00- Dinner
Program (Dec.11 Thurs-Room 1501 & 3435)
- 10:30-12:00 CMC Intensive Lecture (Paul Seymour), Princeton University (Room 1501) :
- 12:00-1:30 Lunch
- 1:30-3:00 CMC Intensive Lecture (Maria Chudnovsky), Columbia University (Room 1501) :
- 3:00-3:40 Coffee Break
- 3:40-4:10 Suyoung Choi (최수영), Ajou University (Room 3435): T.B.A.
- 4:20-4:50 Jaehoon Kim (김재훈), University of Birmingham (Room 3435): Regular subgraphs in uniform hypergraphs
- 5:00-5:30 Ilkyoo Choi (최일규), KAIST (Room 3435): On choosability with separation of planar graphs with forbidden cycles
- 6:00- Banquet
Program (Dec.12 Fri-Room 1501)
- 10:30-12:00 CMC Intensive Lecture (Paul Seymour), Princeton University :
- 12:00-1:30 Lunch
- 1:30-3:00 CMC Intensive Lecture (Maria Chudnovsky), Columbia University :
- 3:00-3:30 Coffee Break
- 3:30-4:30 Petr Hliněný, Masaryk University: Planar graph emulators – Beyond planarity in the plane
- 4:45-5:45 Discussion
- 6:00- Dinner
denote the set of positive integers n such that each transitive action of degree n is multiplicity-free, and 
denote the set of 
such that n=pq for some primes p, q with ![p<q[/latex] and [latex](p,q-1)=1[/latex] where (m,l) is the greatest common divisor of m and n. Our main result shows that [latex]\mathcal{PQ}\backslash \mathcal{MF}[/latex] is the union of <center>[latex]\{pq\in \mathcal{PQ}\mid (p,q-2)=p, q\mbox{ is a Fermat prime}\}](https://s0.wp.com/latex.php?latex=p%3Cq%26%2391%3B%2Flatex%26%2393%3B+and+%26%2391%3Blatex%26%2393%3B%28p%2Cq-1%29%3D1%26%2391%3B%2Flatex%26%2393%3B+where+%28m%2Cl%29+is+the+greatest+common+divisor+of+m+and+n.+Our+main+result+shows+that+%26%2391%3Blatex%26%2393%3B%5Cmathcal%7BPQ%7D%5Cbackslash+%5Cmathcal%7BMF%7D%26%2391%3B%2Flatex%26%2393%3B+is+the+union+of+%3Ccenter%3E%5Blatex%5D%5C%7Bpq%5Cin+%5Cmathcal%7BPQ%7D%5Cmid+%28p%2Cq-2%29%3Dp%2C+q%5Cmbox%7B+is+a+Fermat+prime%7D%5C%7D&bg=ffffff&fg=000000&s=0 "p<q[/latex] and [latex](p,q-1)=1[/latex] where (m,l) is the greatest common divisor of m and n. Our main result shows that [latex]\mathcal{PQ}\backslash \mathcal{MF}[/latex] is the union of <center>[latex]\{pq\in \mathcal{PQ}\mid (p,q-2)=p, q\mbox{ is a Fermat prime}\}")
and 