PURE Final Report-Hrushovski Theorem on Simple Graphs and Tournaments

Simple item page
dc.contributor.authorQian, Xinjie
dc.date.accessioned2018-09-26T19:08:40Z
dc.date.available2018-09-26T19:08:40Z
dc.date.issued2018-09-19
dc.description.abstractI 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.citationQian, X. (2018). PURE Final Report-Hrushovski Theorem on Simple Graphs and Tournaments (Rep.). Calgary, AB: University of Calgary.en_US
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/32996
dc.identifier.urihttp://hdl.handle.net/1880/108059
dc.language.isoenen_US
dc.publisherUniversity of Calgaryen_US
dc.publisher.departmentMathematics & Statisticsen_US
dc.publisher.facultyScienceen_US
dc.publisher.institutionUniversity of Calgaryen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0en_US
dc.subjectGraph Theoryen_US
dc.subjectHrushovski Propertyen_US
dc.subjectTournamentsen_US
dc.subjectAutomorphismen_US
dc.titlePURE Final Report-Hrushovski Theorem on Simple Graphs and Tournamentsen_US
dc.typeunknown
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ucalgary_2018_qian_xinjie.pdf
Size:
137.08 KB
Format:
Adobe Portable Document Format
Description:
Final Report
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.92 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
PURE Research Report
Undergraduate Research & Publications