Speaker: Cheolwon Heo Location: C103 Date and Time: Sep 29
About the Speaker: Dr. Cheolwon Heo
- 2025.02 - present : Assistant Professor, SUNY Korea
- 2023.03. - 2025.01.: Research Fellow, Korea Institute for Advanced Study (KIAS)
- 2021.09. - 2023.02.: Research Fellow, Applied Algebra and Optimization Research Center (AORC), Sungkyunkwan University
- 2021.08. Ph. D. in Combinatorics and Optimization (Advisor: Bertrand Guenin), University of Waterloo, Canada.
- 2016.04. MMath D. in Combinatorics and Optimization (Advisor: Bertrand Guenin), University of Waterloo, Canada.
- 2012.08. B.S. in Mathematical Sciences, KAIST, Korea.
Abstract
In this introductive talk, we will explore various approaches to extending fundamental concepts and theorems of graph theory
to signed graphs, focusing particularly on the connections with Laplacian spectrum and graph coloring. Signed graphs were first
introduced by Harary (1953) through the foundational concepts and balance theory, and were later systematically developed by
Zaslavsky (1982) within broader geometric and combinatorial frameworks.
We will discuss the properties and key concepts of signed graphs, examining how familiar results in graph theory reveal
new insights when applied to signed graphs.
Through this exploration, we aim to highlight the potential applications and expanded perspectives that signed graph theory offers.