KIAS Combinatorics Workshop Series

21st Workshop Home > 21st Workshop

KIAS-AORC Joint Workshop
(The 21st KIAS Combinatorics Workshop)

will be held in Elysian Gangchon on August 20-23, 2018.
(Main Organizers: Jang Soo Kim, Seunghyun Seo)


This workshop is organized as a special event "Summer School for Combinatorics".
 

  • Date: August 20-23 (Mon-Thu), 2018
  • Venue: Elysian Gangchon (map: google  naver ; direction: pdf), Chuncheon
     
  • Invited Speaker (Lecturer)
    Sang-il Oum (KAIST)

     
  • Registration: If you want to participate in the workshop, please register at the registration page until Aug 5.
     
  • Support
  • (1) Meal: We provide all meals during the workshop to all participants.
  • (2) Transportation: There will be a shuttle bus KIAS -> Elysian Gangchon (Aug 20, 11:30 AM) and Elysian Gangchon -> KIAS (Aug 23, 3:30 PM).
  • (3) Accommodation:
    - We will make a reservation for you at Elysian Gangchon on the basis of first come, first served. Please notice that you may share a room with other participants.

     
  • Topics of the Lecture
    • - Title: An Introduction to Graph Theory
    • - Abstract: In this lecture, I aim to cover the proof of Kuratowski's theorem stating that a graph is planar if and only if it does not have a subdivision of K_3,3 or a subdivision of K_5 as a subgraph. For that, we will need to develop tools for 3-connected graphs. We will build necessary tools towards the proof of Kuratowski's theorem. After the proof, we will talk about its ultimate generalizations, called the graph minor theorem of Robertson and Seymour.


        Lecture 1-3: Connectivity 

        * 2-connected graphs

        * Menger's theorem

        * 3-connected graphs

       

        Lecture 4-6: Planar graphs

        * Structures of 3-connected planar graphs

        * Proof of Kuratowski's theorem

       

        Lecture 7-8: Graph minors and well-quasi-ordering 

        * Well-quasi-ordering

        * Higman's lemma and Kruskal's theorem 

        * Graph Minor Theorem (survey)

      All lectures will be delivered in Korean.
       

      • Schedule (Click here for abstracts.)   
        [1st Day: Aug 20 (Mon)] 13:30 ~ 20:00
          13:30~14:00 Registration and Opening address
          14:00~15:15 Connectivity: 2-connected graph
          15:15~15:45 Coffee Break
          15:45~17:00 Connectivity: Menger's Theorem
          17:00~18:00 Group Photo, Doing homework I
          18:20~20:00 Welcome reception (Brief introductions of all participants)

        [2nd Day: Aug 21 (Tue)] 09:15 ~ 19:30
          09:15~10:30 Connectivity: 3-connected graph
          10:30~11:00 Coffee Break
          11:00~12:15 Planar graph: Structures of 3-connected planar graphs
          12:15~14:00 Lunch
          14:00~15:00 Discussion session for homework I problems
          15:00~15:30 Coffee Break
          15:30~17:30 Doing homework II 
          18:00~19:30 Dinner

        [3rd Day: Aug 22 (Wed)] 09:15 ~ 20:30
          09:15~10:30 Planar graph: Proof of Kuratowski's theorem I
          10:30~11:00 Coffee Break
          11:00~12:15 Planar graph: Proof of Kuratowski's theorem II
          12:15~14:00 Lunch
          14:00~15:00 Discussion session for homework II problems
          15:00~15:30 Coffee Break
          15:30~17:30 Doing homework III
          18:00~20:30 Banquet


        [4th Day: Aug 23 (Thu)] 09:15 ~ 15:10
          09:15~10:30 Graph minors and well-quasi-ordering I
          10:30~11:00 Coffee Break
          11:00~12:15 Graph minors and well-quasi-ordering II
          12:15~14:00 Lunch
          14:00~15:00 Discussion session for homework III problems
          15:00~15:10 Awards, Closing remark