Konferenzen  >  Mathematik  >  Graphentheorie und Kombinatorik  >  Großbritannien

University of Liverpool

This two day Colloquium aims to bring together researchers in discrete mathematics, from areas such as structural and algorithmic graph theory, extremal combinatorics, logic and foundations of Computer Science. There is a four-hour tutorial on Constraint Satisfaction Problems given by Andrei Krokhin (Durham), nine invited talks, and a session with contributed one slide pitches by junior researchers.

Constraint Satisfaction Problems, Extremal Combinatorics, Structural Graph Theory, Algorithmic Meta Theorems.

Mathematische Logik, Grundlagen der Mathematik,    Optimierungsrechnung, Entscheidungsunterstützung

The International Centre for Mathematical Sciences (ICMS)

Recent research has pointed to fundamental underlying relationships between each of three sub-fields of combinatorics: matroid theory, structural graph theory, and topological graph theory. While the connection between matroids and graphs is long-established, newer foundational links with topological graph theory are creating fresh opportunities for cross-disciplinary advances. The purpose of this workshop is to provide the first dedicated forum to bring together experts in all these three fields to share techniques and approaches, and seed ongoing cross-disciplinary collaboration and advances.

Algebra,    Geometrie und Topologie