{"id":{"repo_id":"wfu","oai_identifier":"oai:wakespace.lib.wfu.edu:10339/38542"},"canonical_url":"https://search.dev.ndltd.org/etd/wfu/oai:wakespace.lib.wfu.edu:10339/38542","repository":{"repo_id":"wfu","name":"Wake Forest University","base_url":"https://wakespace.lib.wfu.edu/oai/request"},"display":{"title":"On the Existence of Knots and Links in the Complete Directed Graph on Six Vertices","abstract":"In 1983, John H. Conway and Cameron Gordon published \"Knots and Links in Spatial Graphs\" in the Journal of Graph Theory. In this paper, Conway and Gordon proved that the complete graph on six vertices is intrinsically linked. That is, any embedding of the complete graph on six vertices contains at least one pair of disjoint triangles that forms a nontrivial link. The complete directed graph on six vertices is defined to be the graph consisting of six vertices such that each pair of distinct vertices is connected by exactly one pair of edges with the property that this pair forms a 2-cycle. Given that the complete graph on six vertices is intrinsically linked, we conjecture that the complete directed graph on six vertices is as well. In the pages that follow, we present a collection of results that we obtained through our efforts to prove that the complete directed graph on six vertices is intrinsically linked. These results include several cases in which we have shown that embeddings of the complete directed graph on six vertices contain one or more pairs of disjoint directed triangles. We also consider the subgraphs of the complete directed graph on six vertices and the number of pairs of disjoint directed triangles that may be contained in a single subgraph.","abstract_html":"In 1983, John H. Conway and Cameron Gordon published "Knots and Links in Spatial Graphs" in the Journal of Graph Theory. In this paper, Conway and Gordon proved that the complete graph on six vertices is intrinsically linked. That is, any embedding of the complete graph on six vertices contains at least one pair of disjoint triangles that forms a nontrivial link. The complete directed graph on six vertices is defined to be the graph consisting of six vertices such that each pair of distinct vertices is connected by exactly one pair of edges with the property that this pair forms a 2-cycle. Given that the complete graph on six vertices is intrinsically linked, we conjecture that the complete directed graph on six vertices is as well. In the pages that follow, we present a collection of results that we obtained through our efforts to prove that the complete directed graph on six vertices is intrinsically linked. These results include several cases in which we have shown that embeddings of the complete directed graph on six vertices contain one or more pairs of disjoint directed triangles. We also consider the subgraphs of the complete directed graph on six vertices and the number of pairs of disjoint directed triangles that may be contained in a single subgraph.","abstract_has_math":false,"creators":["Rich, Natalie Rose"],"institution":"Wake Forest University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013","date_published":"2013","updated_at":"2026-07-27T22:01:33Z","subjects":["Directed Graph"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10339/38542","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Rich, Natalie Rose"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-06-06T21:19:29Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-06-06T21:19:29Z"]},{"key":"dc:date.issued","label":"Date","values":["2013"]},{"key":"dc:publisher","label":"Institution","values":["Wake Forest University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Directed Graph"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10339/38542"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In 1983, John H. Conway and Cameron Gordon published \"Knots and Links in Spatial Graphs\" in the Journal of Graph Theory. In this paper, Conway and Gordon proved that the complete graph on six vertices is intrinsically linked. That is, any embedding of the complete graph on six vertices contains at least one pair of disjoint triangles that forms a nontrivial link. The complete directed graph on six vertices is defined to be the graph consisting of six vertices such that each pair of distinct vertices is connected by exactly one pair of edges with the property that this pair forms a 2-cycle. Given that the complete graph on six vertices is intrinsically linked, we conjecture that the complete directed graph on six vertices is as well. In the pages that follow, we present a collection of results that we obtained through our efforts to prove that the complete directed graph on six vertices is intrinsically linked. These results include several cases in which we have shown that embeddings of the complete directed graph on six vertices contain one or more pairs of disjoint directed triangles. We also consider the subgraphs of the complete directed graph on six vertices and the number of pairs of disjoint directed triangles that may be contained in a single subgraph."]},{"key":"dc:title","label":"Title","values":["On the Existence of Knots and Links in the Complete Directed Graph on Six Vertices"]}]}],"canonical_facts":{"dc:creator":["Rich, Natalie Rose"],"dc:date.accessioned":["2013-06-06T21:19:29Z"],"dc:date.available":["2013-06-06T21:19:29Z"],"dc:date.issued":["2013"],"dc:description.abstract":["In 1983, John H. Conway and Cameron Gordon published \"Knots and Links in Spatial Graphs\" in the Journal of Graph Theory. In this paper, Conway and Gordon proved that the complete graph on six vertices is intrinsically linked. That is, any embedding of the complete graph on six vertices contains at least one pair of disjoint triangles that forms a nontrivial link. The complete directed graph on six vertices is defined to be the graph consisting of six vertices such that each pair of distinct vertices is connected by exactly one pair of edges with the property that this pair forms a 2-cycle. Given that the complete graph on six vertices is intrinsically linked, we conjecture that the complete directed graph on six vertices is as well. In the pages that follow, we present a collection of results that we obtained through our efforts to prove that the complete directed graph on six vertices is intrinsically linked. These results include several cases in which we have shown that embeddings of the complete directed graph on six vertices contain one or more pairs of disjoint directed triangles. We also consider the subgraphs of the complete directed graph on six vertices and the number of pairs of disjoint directed triangles that may be contained in a single subgraph."],"dc:identifier.uri":["http://hdl.handle.net/10339/38542"],"dc:language.iso":["en"],"dc:publisher":["Wake Forest University"],"dc:subject":["Directed Graph"],"dc:title":["On the Existence of Knots and Links in the Complete Directed Graph on Six Vertices"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T22:01:33Z"}