Graphs and Matroids Seminar

Title: Counting biased cliques

Abstract: A biased graph is a pair consisting of an undirected graph G, together with a collection of its circuits called `balanced' for which no theta-graph contains exactly two balanced cycles. These objects are to group-labelled graphs what matroids are to matrices. I will discuss a theorem that counts these graphs in the case where G is a clique on n vertices. This is ongoing joint work with Jorn van der Pol.