Highly connected subgraphs in sparse graphs
Henry Liu
Central South University, Changsha, China
Central South University, Changsha, China
2017/6/15 Thu 2PM-3PM
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).
Joint work with Shinya Fujita (Yokohama City University, Japan) and Amites Sarkar (Western Washington University, USA).