Graph Theory and Combinatorics

Combinatorics and graph theory are fundamental to computational mathematics, supplying the language and discrete structures on which algorithms, complexity analysis and data models are built. This workshop will highlight new results and recent developments in algebraic, enumerative and geometric combinatorics, with a particular focus on advanced algebraic structures and random graphs. Another focus will be on extremal and structural combinatorics, including graph-limit theory and logic-based techniques that expose how local constraints govern the behaviour of large networks.
This workshop will have connections to other FoCM workshops, including “Foundations of Data Science and Machine Learning”, “Special Functions and Orthogonal Polynomials”, “Random Matrices”, “Computational Number Theory”, and “Quantum Information and Quantum Algorithms”.

Organizers

Speakers

Semi-plenary speakers

Invited speakers