Tag Archives: orbit-counting lemma

Counting colourings of graphs

Posted on 12/04/2012 by

Every graph theorist knows that the colourings of a graph with a given number of colourings are counted by a certain polynomial, the chromatic polynomial of the graph. My purpose here is to point out that there is more to … Continue reading →

Posted in exposition, open problems | Tagged , , , | Leave a comment

Remoteness

Posted on 11/10/2011 by

After the last bit of bureaucratic nonsense, what a relief to turn to mathematics again. Maximilien Gadouleau and I have just submitted a paper about a concept for finite metric spaces somewhat related to domination, which we call remoteness. It … Continue reading →

Posted in exposition, mathematics, open problems, symmetric group | Tagged , , | Leave a comment