Show simple item record

dc.contributor.advisorNaimi, Ramin
dc.contributor.authorMoore, Nancy
dc.contributor.authorWade, Michael
dc.date.accessioned2020-08-13T14:57:28Z
dc.date.available2020-08-13T14:57:28Z
dc.date.issued2008-01-01 0:00
dc.identifier.urihttps://scholar.oxy.edu/handle/20.500.12711/1026
dc.description.abstractIn the field of topology, intrinsically knotted graphs are rare graphs in which all embeddings contain a nontrivial knot. There are a finite number of these graphs and only a handful of graphs have been proven to be intrinsically knotted; the last one being in 2005. We adapted a known method for proving intrinsic knottedness, and applied it to graphs we had created. During our research John Miller wrote a new computer program for testing if a graph was new.By using these resources, we demonstrated the existence of two new intrinsically knotted graphs.
dc.description.sponsorshipHoward Hughes Medical Institute Undergraduate Science Education Grant to NM, Occidental College Summer Research Program Fellowship to MW
dc.titleDiscovering New Intrinsically Knotted Graphs Nancy Moore and Michael Wade
dc.typearticle
dc.abstract.formathtml
dc.description.departmentmath
dc.source.issueurc_student
dc.identifier.legacyhttps://scholar.oxy.edu/urc_student/1025
dc.source.statuspublished


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record