Organized by: Joshua Cooper (cooper@math.sc.edu), Alec Helm (ah191@email.sc.edu), and Isaiah Hollars (isaiah.hollars@sc.edu) This page will be updated as new seminars are scheduled. Make sure to check ...

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 focuses on studying finite objects. It is an exciting area that has many connections to computer science, algebra, optimization, representation theory, and algebraic geometry. Our ...

Random graph theory provides a probabilistic framework for modelling and analysing networks in which connections between entities are assigned according to specified random processes. From its origins ...

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

Recognise two graphs as being isomorphic if there is a one-to-one relationship between the vertices of the two graphs based on, for instance, vertex degrees and adjacency matrices State the ...

A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place. These PowerPoints form full lessons of work that together cover the new AS level ...

Join one of the most vibrant and forward-looking graduate Mathematics programs in Canada. Mathematics is a vital human endeavour that has important outcomes and applications in almost any field. The ...