Top Posts
Recent comments
 Peter Cameron on New web address
 Peter Cameron on New web address
 dockie73 on New web address
 AMBAT VIJAYAKUMAR on George F. Simmons
 For DeepArcher « Log24 on George F. Simmons
Blogroll
 Astronomy Picture of the Day
 Azimuth
 British Combinatorial Committee
 Comfortably numbered
 Diamond Geezer
 Exploring East London
 From hill to sea
 Gödel's lost letter and P=NP
 Gil Kalai
 Jane's London
 Jon Awbrey
 Kourovka Notebook
 LMS blogs page
 Log24
 London Algebra Colloquium
 London Reconnections
 MathBlogging
 Micromath
 Neill Cameron
 neverendingbooks
 Noncommutative geometry
 numericana hall of fame
 Ratio bound
 Robert A. Wilson's blog
 Since it is not …
 Spitalfields life
 Sylvy's mathsy blog
 SymOmega
 Terry Tao
 The Aperiodical
 The De Morgan Journal
 The ICA
 The London column
 The Lumber Room
 The matroid union
 Theorem of the day
 Tim Gowers
 XKCD
Find me on the web

Join 664 other subscribers
Cameron Counts: RSS feeds
Meta
Tag Archives: orbitcounting lemma
Advanced Combinatorics: the St Andrews lectures
Three years ago, when I joined the School of Mathematics and Statistics at the University of St Andrews, it was suggested that I might like to give a final year MMath module on “Advanced Combinatorics”. No compulsion. Well, of course … Continue reading
Posted in Lecture notes
Tagged Catalan numbers, chromatic polynomial, cycle index, doocot principle, enumeration, formal power series, Friendship Theorem, Gaussian coefficients, generalised line graphs, generalised quadrangles, IBIS groups, line graphs, Mathieu groups, matroid, Moebius inversion, orbitcounting lemma, projective planes, root systems, strongly regular graphs, symmetric Sudoku, triangle property, Tutte polynomial, weight enumerator
Leave a comment
Orbital combinatorics
Yesterday I went to Edinburgh to give a colloquium talk about synchronization, including the recent stuff about butterflies. The day before, I had discussed Artur Schäfer’s work with him, and he expressed a hope that if he went to the … Continue reading
Counting colourings of graphs
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 acyclic orientations, InclusionExclusion, orbitcounting lemma, Petersen graph
1 Comment
Remoteness
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