Breadcrumb
Combinatorics
Combinatorics concerns the study of discrete objects — sets endowed with some additional structure, such as designs, graphs, permutations or posets.
Research into combinatorics in Bristol is broad. Enumerative combinatorics is represented in the study of permutation patterns, combinatorial representation theory and Latin squares, while colouring and extremal problems in graph theory, random partial orders, and, more generally, properties of relational structures are among the research topics studied in structural and extremal combinatorics.
There is a regular Combinatorics Seminar.
The Szekeres Snark (a public domain image).
Snarks are connected graphs in which every vertex is incident to exactly three edges, removal of a single edge does not disconnect the graph, and the edges cannot be coloured by three colours without two of the same colour meeting at a vertex. This is the fifth known example.