CUMC Presentation-Graph Theory

I worked with Dr. Mike Pawliuk at University of Calgary for a summer research on Graph Theory summer 2018. We mainly examined the EPPA property on simple graphs and researching its application on tournaments. Milliet’s paper proved this property for simple graphs, and I presented part of the proof in details during this year’s CUMC (Canadian undergraduate math conference.) Specifically, I proved that “Every isomorphism between ‘poor’ subgraphs extends to a full automorphism of G(X, n).”

g-x-n-01g-x-n-02g-x-n-03g-x-n-04g-x-n-05g-x-n-06g-x-n-07g-x-n-08g-x-n-09g-x-n-10g-x-n-11g-x-n-12g-x-n-13g-x-n-14g-x-n-15g-x-n-16g-x-n-17g-x-n-18g-x-n-19g-x-n-20