PURE Final Report-Hrushovski Theorem on Simple Graphs and Tournaments

dc.contributor.author	Qian, Xinjie
dc.date.accessioned	2018-09-26T19:08:40Z
dc.date.available	2018-09-26T19:08:40Z
dc.date.issued	2018-09-19
dc.description.abstract	I worked with Dr. Micheal Pawliuk at the University of Calgary on this summer research. It was about graph theory, a topic in the field of pure mathematics. The research involved two main components: understand the details of the article ``Extending partial isomorphisms of finite graphs'' (Milliet,2004) and code the algorithm presented in the article in Sage; and extend the results to a case that is unresolved. The specific theorem we worked on is ``the Hrushovski property for graphs'' or the ``Extension property for partial automorphisms (EPPA) for graphs. (Hrushovski, 1992)'	en_US
dc.identifier.citation	Qian, X. (2018). PURE Final Report-Hrushovski Theorem on Simple Graphs and Tournaments (Rep.). Calgary, AB: University of Calgary.	en_US
dc.identifier.doi	http://dx.doi.org/10.11575/PRISM/32996
dc.identifier.uri	http://hdl.handle.net/1880/108059
dc.language.iso	en	en_US
dc.publisher	University of Calgary	en_US
dc.publisher.department	Mathematics & Statistics	en_US
dc.publisher.faculty	Science	en_US
dc.publisher.institution	University of Calgary	en_US
dc.rights.uri	https://creativecommons.org/licenses/by/4.0	en_US
dc.subject	Graph Theory	en_US
dc.subject	Hrushovski Property	en_US
dc.subject	Tournaments	en_US
dc.subject	Automorphism	en_US
dc.title	PURE Final Report-Hrushovski Theorem on Simple Graphs and Tournaments	en_US
dc.type	unknown