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 ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations. Graph ...

Discrete Mathematics plays an important role in explaining key concepts ... recurrence and recursive programming, and how graphs relate to efficient algorithms. No credit for Math or CS majors.

The course covers fundamental ideas from discrete mathematics, especially for computer science students. It focuses on topics that will be foundational for future courses including algorithms, ...

Stacho eds., Special issue of Discrete Mathematics: Combinatorics 2006, A meeting in celebration of Pavol Hell’s 60th birthday, Vol. 309, 2009. D. Kral, J-S. Sereni, L. Stacho, Min-max relations for ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications ... trees and more general graphs. DETAILED COURSE TOPICS: All sections will deal ...

Her research interests include combinatorial designs and graph decompositions. Keranen also enjoys teaching students at all levels, and regularly teaches several courses in discrete mathematics. J.

Graph theory. The fourth number of the course code shows the level of the course. For example, in course 219206, the fourth number is a 2, so it is a 200-level course (usually studied in the second ...