Suil O (오수일) presented his work on an upper bound of the 3rd largest eigenvalue of a regular graph to guarantee the existence of an odd (1,b)-factor at the discrete math seminar

On June 19, 2019, Suil O (오수일) from SUNY Korea, Incheon presented his work on an upper bound of the third largest eigenvalue of a connected r-regular graph to have an odd (1,b)-factor. The title of his talk was “An odd [1,b]-factor in regular graphs from eigenvalues“.