Learning Outcomes for 3450:415/515 Combinatorics and Graph Theory

Students are expected to be able to

• Understand and apply the basic concepts of graph theory, including Eulerian trails, Hamiltonian cycles, bipartite graphs, planar graphs, and Euler characteristics.
• Use permutations and combinations to solve counting problems with sets and multisets
• Compute a generating function and apply them to combinatorial problems
• Set up and solve a linear recurrence relation
• Apply the inclusion/exclusion principle
{"ft_lang_label":"__label__en","ft_lang_prob":0.8340756,"math_prob":0.9124093,"size":517,"snap":"2021-31-2021-39","text_gpt3_token_len":108,"char_repetition_ratio":0.11500975,"word_repetition_ratio":0.0,"special_character_ratio":0.18955512,"punctuation_ratio":0.0875,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96222574,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-20T22:25:31Z\",\"WARC-Record-ID\":\"<urn:uuid:4c9a75bb-c097-4bb0-ad25-d2301d40ef64>\",\"Content-Length\":\"31488\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7214b721-12b5-4b66-bf85-bffa7db81f36>\",\"WARC-Concurrent-To\":\"<urn:uuid:eae56976-b583-437d-87af-5f1e879a0e42>\",\"WARC-IP-Address\":\"75.2.27.170\",\"WARC-Target-URI\":\"https://www.uakron.edu/math/academics/syllabi/415-515-combinatorics-and-graph-theory.dot\",\"WARC-Payload-Digest\":\"sha1:AFYWDTKXFVXU6SBOGQTQ2CC5EHP3KRQJ\",\"WARC-Block-Digest\":\"sha1:74DLTCTSUXO3LYB5GNHMA5JBN2WWRY4P\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057119.85_warc_CC-MAIN-20210920221430-20210921011430-00183.warc.gz\"}"}