Mathematics Seminar - 04/08/26

Abstract:

Perfect graphs, introduced by Claude Berge in 1961, occupy a unique position in graph theory because of their simplicity, elegance, and unifying power. We will look at perfect graphs, their structure, morphology, and algorithmic aspects, both from within and from outside. Recently, Chinh T. Hoang made several conjectures about perfectly divisible graphs, a generalization of perfect graphs. We refute one of these conjectures and prove special cases of several of the others. This is joint work with my PhD student Mohammed A. Mutar.

Note:

Contact Prof. Shantia Yarahmadian at syarahmadian@math.msstate.edu or (662) 325-7143 for additional information.