{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-2422"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-2422","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"A set of tournaments with many Hamiltonian cycles","abstract":"For a random tournament on $3^n$ vertices, the expected number of Hamiltonian cycles is known to be $(3^n -1)!/2^{3^n}$. Let $T_1$ denote a tournament of three vertices $ {v_1, v_2, v_3}$. Let the orientation be such that there are directed edges from $v_1 $to $v_2$ , from $v_2$ to $v_3$ and from $v_3$ to $ v_1$. Construct a tournament $T_i$ by making three copies of $T_{i-1}$, $T_{i-1}'$, $T_{i-1}''$ and $T_{i-1}'''$. Let each vertex in $T_{i-1}'$ have directed edges to all vertices in $T_{i-1}''$, similarly place directed edges from each vertex in $T_{i-1}''$ to all vertices in $T_{i-1}'''$ and from $T_{i-1}'''$ to $T_{i-1}'$. In this thesis, we shall study this family of highly symmetric tournaments. In particular we shall present two different algorithms to calculate the number of Hamiltonian cycles in these tournaments and compare them with the expected number and with known bounds for random tournaments. This thesis is motivated by the question of the maximum number of Hamiltonian cycles a tournament can have.","abstract_html":"For a random tournament on <span class=\"etd-inline-math\">3<sup>n</sup></span> vertices, the expected number of Hamiltonian cycles is known to be <span class=\"etd-inline-math\">(3<sup>n</sup> -1)!/2<sup>3<sup>n</sup></sup></span>. Let <span class=\"etd-inline-math\">T<sub>1</sub></span> denote a tournament of three vertices <span class=\"etd-inline-math\"> {v<sub>1</sub>, v<sub>2</sub>, v<sub>3</sub>}</span>. Let the orientation be such that there are directed edges from <span class=\"etd-inline-math\">v<sub>1</sub> </span>to <span class=\"etd-inline-math\">v<sub>2</sub></span> , from <span class=\"etd-inline-math\">v<sub>2</sub></span> to <span class=\"etd-inline-math\">v<sub>3</sub></span> and from <span class=\"etd-inline-math\">v<sub>3</sub></span> to <span class=\"etd-inline-math\"> v<sub>1</sub></span>. Construct a tournament <span class=\"etd-inline-math\">T<sub>i</sub></span> by making three copies of <span class=\"etd-inline-math\">T<sub>i-1</sub></span>, <span class=\"etd-inline-math\">T<sub>i-1</sub>&#x27;</span>, <span class=\"etd-inline-math\">T<sub>i-1</sub>&#x27;&#x27;</span> and <span class=\"etd-inline-math\">T<sub>i-1</sub>&#x27;&#x27;&#x27;</span>. Let each vertex in <span class=\"etd-inline-math\">T<sub>i-1</sub>&#x27;</span> have directed edges to all vertices in <span class=\"etd-inline-math\">T<sub>i-1</sub>&#x27;&#x27;</span>, similarly place directed edges from each vertex in <span class=\"etd-inline-math\">T<sub>i-1</sub>&#x27;&#x27;</span> to all vertices in <span class=\"etd-inline-math\">T<sub>i-1</sub>&#x27;&#x27;&#x27;</span> and from <span class=\"etd-inline-math\">T<sub>i-1</sub>&#x27;&#x27;&#x27;</span> to <span class=\"etd-inline-math\">T<sub>i-1</sub>&#x27;</span>. In this thesis, we shall study this family of highly symmetric tournaments. In particular we shall present two different algorithms to calculate the number of Hamiltonian cycles in these tournaments and compare them with the expected number and with known bounds for random tournaments. This thesis is motivated by the question of the maximum number of Hamiltonian cycles a tournament can have.","abstract_has_math":true,"creators":["Ushijima-mwesigwa, Hayato"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mathematical Science","degree_department":null,"school":null,"contributors":["Calkin, Neil","Novick , Beth","Warner , Daniel"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:08:32Z","subjects":["combinatorics","graphs","Hamilton cycles","Hamiltonian cycles","tournaments","Applied Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/1422","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/1422","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aall_theses-2422","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Calkin, Neil","Novick , Beth","Warner , Daniel"]},{"key":"dc:creator","label":"Author","values":["Ushijima-mwesigwa, Hayato"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-09-30T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2012-08-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["combinatorics","graphs","Hamilton cycles","Hamiltonian cycles","tournaments","Applied Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/1422"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["For a random tournament on $3^n$ vertices, the expected number of Hamiltonian cycles is known to be $(3^n -1)!/2^{3^n}$. Let $T_1$ denote a tournament of three vertices $ {v_1, v_2, v_3}$. Let the orientation be such that there are directed edges from $v_1 $to $v_2$ , from $v_2$ to $v_3$ and from $v_3$ to $ v_1$. Construct a tournament $T_i$ by making three copies of $T_{i-1}$, $T_{i-1}'$, $T_{i-1}''$ and $T_{i-1}'''$. Let each vertex in $T_{i-1}'$ have directed edges to all vertices in $T_{i-1}''$, similarly place directed edges from each vertex in $T_{i-1}''$ to all vertices in $T_{i-1}'''$ and from $T_{i-1}'''$ to $T_{i-1}'$. In this thesis, we shall study this family of highly symmetric tournaments. In particular we shall present two different algorithms to calculate the number of Hamiltonian cycles in these tournaments and compare them with the expected number and with known bounds for random tournaments. This thesis is motivated by the question of the maximum number of Hamiltonian cycles a tournament can have."]},{"key":"dc:title","label":"Title","values":["A set of tournaments with many Hamiltonian cycles"]}]}],"canonical_facts":{"dc:contributor":["Calkin, Neil","Novick , Beth","Warner , Daniel"],"dc:creator":["Ushijima-mwesigwa, Hayato"],"dc:date.available":["2015-09-30T07:00:00Z"],"dc:date.created":["2012-08-01T07:00:00Z"],"dc:description.abstract":["For a random tournament on $3^n$ vertices, the expected number of Hamiltonian cycles is known to be $(3^n -1)!/2^{3^n}$. Let $T_1$ denote a tournament of three vertices $ {v_1, v_2, v_3}$. Let the orientation be such that there are directed edges from $v_1 $to $v_2$ , from $v_2$ to $v_3$ and from $v_3$ to $ v_1$. Construct a tournament $T_i$ by making three copies of $T_{i-1}$, $T_{i-1}'$, $T_{i-1}''$ and $T_{i-1}'''$. Let each vertex in $T_{i-1}'$ have directed edges to all vertices in $T_{i-1}''$, similarly place directed edges from each vertex in $T_{i-1}''$ to all vertices in $T_{i-1}'''$ and from $T_{i-1}'''$ to $T_{i-1}'$. In this thesis, we shall study this family of highly symmetric tournaments. In particular we shall present two different algorithms to calculate the number of Hamiltonian cycles in these tournaments and compare them with the expected number and with known bounds for random tournaments. This thesis is motivated by the question of the maximum number of Hamiltonian cycles a tournament can have."],"dc:identifier":["https://open.clemson.edu/all_theses/1422"],"dc:subject":["combinatorics","graphs","Hamilton cycles","Hamiltonian cycles","tournaments","Applied Mathematics"],"dc:title":["A set of tournaments with many Hamiltonian cycles"],"thesis:degree_discipline":["Mathematical Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:08:32Z"}