Title   name
2017 Discrete Math 세미나
  Speaker   Henry Liu  
  Date 2017-06-15
  Place KAIST
  File  의 1 번째 Real Media 동영상입니다.
Abstract : Let G be a graph on n vertices with independence number α. How large must a k-connected subgraph G contain? We shall present the best possible answers when α=2 and α=3. Some open questions will also be presented.

Joint work with Shinya Fujita (Yokohama City University, Japan) and Amites Sarkar (Western Washington University, USA).