{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-9757"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-9757","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"An Introduction to Combinatorics via Cayley's Theorem","abstract":"In this paper, we explore some of the methods that are often used to solve combinatorial problems by proving Cayley’s theorem on trees in multiple ways. The intended audience of this paper is undergraduate and graduate mathematics students with little to no experience in combinatorics. This paper could also be used as a supplementary text for an undergraduate combinatorics course.","abstract_html":"In this paper, we explore some of the methods that are often used to solve combinatorial problems by proving Cayley’s theorem on trees in multiple ways. The intended audience of this paper is undergraduate and graduate mathematics students with little to no experience in combinatorics. This paper could also be used as a supplementary text for an undergraduate combinatorics course.","abstract_has_math":false,"creators":["Willis, Jaylee"],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["David Brown","Matthew Young","Zhaohu Nie"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:53:03Z","subjects":["combinatorics","cayley's theorem","spanning trees","Statistics and Probability"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/fccc-4f9b"],"render_values":[{"text":"https://doi.org/10.26076/fccc-4f9b","href":"https://doi.org/10.26076/fccc-4f9b","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/8605","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/8605","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://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-9757","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["David Brown","Matthew Young","Zhaohu Nie"]},{"key":"dc:creator","label":"Author","values":["Willis, Jaylee"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2010-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2022-08-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"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","cayley's theorem","spanning trees","Statistics and Probability"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/8605"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/fccc-4f9b"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this paper, we explore some of the methods that are often used to solve combinatorial problems by proving Cayley’s theorem on trees in multiple ways. The intended audience of this paper is undergraduate and graduate mathematics students with little to no experience in combinatorics. This paper could also be used as a supplementary text for an undergraduate combinatorics course."]},{"key":"dc:title","label":"Title","values":["An Introduction to Combinatorics via Cayley's Theorem"]}]}],"canonical_facts":{"dc:contributor":["David Brown","Matthew Young","Zhaohu Nie"],"dc:creator":["Willis, Jaylee"],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["2022-08-01T07:00:00Z"],"dc:description.abstract":["In this paper, we explore some of the methods that are often used to solve combinatorial problems by proving Cayley’s theorem on trees in multiple ways. The intended audience of this paper is undergraduate and graduate mathematics students with little to no experience in combinatorics. This paper could also be used as a supplementary text for an undergraduate combinatorics course."],"dc:identifier":["https://digitalcommons.usu.edu/etd/8605"],"dc:identifier.doi":["https://doi.org/10.26076/fccc-4f9b"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["combinatorics","cayley's theorem","spanning trees","Statistics and Probability"],"dc:title":["An Introduction to Combinatorics via Cayley's Theorem"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:53:03Z"}