### Top Posts

### Recent comments

- Peter Cameron on Apology
- Robin Whitty on Apology
- Peter Cameron on Isbell’s Conjecture
- Sean Eberhard on Isbell’s Conjecture
- Sean Eberhard on Isbell’s Conjecture

### Blogroll

- Alexander Konovalov
- Annoying precision
- Astronomy Picture of the Day
- Azimuth
- Bad science
- Bob Walters
- British Combinatorial Committee
- CIRCA tweets digest
- CoDiMa
- Coffee, love, and matrix algebra
- Collecting reality
- Comfortably numbered
- Computational semigroup theory
- DC's Improbable Science
- Diamond Geezer
- Exploring East London
- From hill to sea
- Gödel's lost letter and P=NP
- Gil Kalai
- Haris Aziz
- Intersections
- Jane's London
- Jon Awbrey
- Kourovka Notebook
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- Marie Cameron's blog
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Paul Goldberg
- Ratio bound
- Robert A. Wilson's blog
- Sheila's blog
- Since it is not …
- Spitalfields life
- St Albans midweek lunch
- Stubborn mule
- Sylvy's mathsy blog
- SymOmega
- Tangential thoughts
- 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
- Vynmath
- XKCD

### Find me on the web

### Cameron Counts: RSS feeds

### Meta

# Tag Archives: graphs

## G2D2, 1: setting the scene

I’m in Yichang, at the China Three Gorges University, for the conference and summer school G2D2 (“Groups and graphs, designs and dynamics”). This is the sixth meeting in the series: the previous ones were G2C2: Groups and graphs, cycles and … Continue reading

Posted in exposition, history, Uncategorized
Tagged designs, dynamics, G2 conferences, graphs, groups, Hangzhou, Three Gorges University, Yichan, Zhejiang University
1 Comment

## OuLiPo

OuLiPo, or Ouvroir de Littérature Potentielle (which they translate as “Charity bazaar of potential literature”) were a collection of writers I knew little about until yesterday. I knew a couple of things: Martin Gardner wrote about them, mentioning among other … Continue reading

Posted in mathematics and ...
Tagged Claude Berge, combinations, games, Georges Perec, graphs, groups, literature, orthogonal Latin squares, permutations, Pierre Rosenstiehl
3 Comments

## Easy to state, hard to solve?

I described here how Pablo Spiga and I showed that all but finitely many nontrivial switching classes of graphs with primitive automorphism group contain a graph with trivial automorphism group, and found the six exceptions. (The trivial switching classes are … Continue reading

Posted in exposition, open problems
Tagged graphs, homomorphisms, primitive groups, rigid graphs, switching classes, tournaments
Leave a comment

## Solutions

The word “solutions” is much overused, even misused, now. When I see a van with “Cleaning solutions” on the side, I imagine it full of containers of ammonia or soapy water, while “Printing solutions” can only mean ink … But … Continue reading

Posted in books, teaching
Tagged Cambridge University Press, codes, Dan Hughes, designs, exercises, graphs, Higman-Sims, Jack van Lint, MUBs, quaternary codes, Westfield College
1 Comment

## Primitive graphs

A primitive graph is one whose automorphism group acts primitively on the vertices: that is, the group is transitive on the vertices, and there is no non-trivial equivalence relation which it preserves. This post is not about why primitive graphs … Continue reading

## The arXiv

It will be absolutely clear to anyone who has given this blog more than a casual glance that I am a dinosaur mired in the 1960s or thereabouts, and quite out of tune with the modern world of Facebook, impact, … Continue reading

## MathOverflow

Today I put a toe into the pool that is MathOverflow for the first time. My question was: Which graphs have the property that the number of i-vertex induced subgraphs is at most i for some i<n/2 (where n is … Continue reading

Posted in doing mathematics, mathematics
Tagged graphs, MathOverflow, permutation groups, PlanetMO
7 Comments

## Transitivity and synchronization

Let Sn be the symmetric group of all permutations of {1,…,n}, and Tn the full transformation monoid of all functions from this set to itself. Recently I have come to the meta-conjecture that there is a fairly close analogy between … Continue reading

Posted in exposition, open problems
Tagged Dixon's theorem, endomorphisms, graphs, groups, semigroups, synchronization, synchronizing monoids
Leave a comment

## Graph limits and random graphs

These ideas are quite new to me, and maybe my exposition of them is a bit incoherent; but I think there are some interesting questions here. An old problem of mine on random graphs with forbidden subgraphs may be illuminated … Continue reading

Posted in events, exposition, open problems
Tagged Endre Szemeredi, exchangeable measure, graphs, Laszlo Lovasz, limit
Leave a comment

## Bases

Sometimes you have to make things more complicated in order to make them simpler. My old friend Aiden Bruen visited this week, and told me about a paper by him and his son Trevor which has just appeared in the … Continue reading

Posted in exposition, mathematics, open problems
Tagged graphs, matroids, vector spaces
Leave a comment