How can Google maps find the fastest path for a trip between two locations? How can an admission system match applicants to the best-suited university based on their preference and exam results? The answers to these questions arise from the study of Discrete Mathematics, which is a branch of Mathematics that deals with entities like integers, sets, graphs with distinct and separate values. The properties of discrete objects and structures play an essential role in many fields such as Theoretical Computer Science, Probability, Statistics, and Cryptography. This course will provide basic knowledge of Combinatorics and Graph theory along with various methods of mathematical reasoning. Students will practice producing and writing formal rigorous proofs. Major topics in this course include set theory, Combinatorial counting methods, Graph theory (Eulerian walk, Hamiltonian cycle, Spanning Tree, Planar graph, etc.).

offering time

Spring 23


Applied Mathematics


Tran Vinh Linh


Course code


Discover the future awaiting
you at Fulbright

Learn how to apply

This site uses cookies to provide a better user experience.

Essential cookies are active by default and are necessary for the proper functioning of the website. Analytics cookies gather anonymous information for us to enhance and monitor the site. Performance cookies are employed by third parties to optimize their applications (such as videos and maps) that are embedded within our website. To accept all cookies, click 'I accept.' Alternatively, choose your preferences for analytics and performance cookies, then select 'Close cookie control.'