An introduction to computational graph theory and generation algorithms

Computers are often used in combinatorics to determine if combinatorial objects with given structural or extremal properties exist as these existence problems are often too complex to solve by hand. This is done by designing and implementing generation algorithms which construct combinatorial objects from a given class (typically avoiding the generation of isomorphic copies) and analysing the resulting objects.

In this talk we will give an introduction to computational graph theory and the design of generation algorithms in particular. We will also give concrete examples of how these generation algorithms have helped to gain new insights and solve problems in mathematics and in chemistry.

Speaker

Jan Goedgebeur is professor at the KU Leuven.

Time and Place

Monday 04/03/2026 at 13:45pm in M.A.143

Registration

Participation is free, but registration is compulsory.

References and Related Reading

You may be interested in this previous presentation on a related topic.