Discrete mathematics is about precision in reasoning as much as it is about solving problems. Proof techniques like induction, contradiction, and direct reasoning are used to establish results in ...

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

1 Apply the basic principles of mathematical logic. 2 Construct and analyse mathematical proofs. 3 Apply the principles of set theory, functions and relations. 4 Apply the principles of abstract ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...

Balancing courses and assignments at UHCL takes more than just attending lectures — it’s about strategic planning, active learning, and making the most of available resources. By combining proven ...

Study in an internationally renowned department and contribute to our pioneering research. You’ll have the chance to produce work that makes an original contribution to the field of mathematics and ...

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...