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

Discrete math is one of the oldest branches of mathematics, with a direct line of descent from problems studied in the most ancient mathematical texts. It includes number theory, the study of patterns ...

This course is available with permission to General Course students. This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering ... basic and advanced counting techniques, recurrences and elementary graph ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science ... analysis techniques based on counting methods and recurrence ...

It is commonly believed that vertex-transitive graphs (and in particular Cayley graphs) tend to contain hamilton cycles. The only known connected vertex-transitive graphs without hamilton cycles are K ...

P. Horak, L. Stacho eds., Special issue of Discrete Mathematics: Combinatorics 2006, A meeting in celebration of Pavol Hell’s 60th birthday, Vol. 309, 2009. D. Kral ...

Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, relations and functions, recursion and generating functions, applications to ...