### Top Posts

### Recent comments

- Robin Chapman on Tools for mathematicians
- Peter Cameron on Tools for mathematicians
- Robin Chapman on Tools for mathematicians
- Robin Chapman on Tools for mathematicians
- Benjamin Steinberg on Tools for mathematicians

### Blogroll

- Annoying precision
- Astronomy Picture of the Day
- Azimuth
- Bad science
- Bob Walters
- Computational semigroup theory
- DC's Improbable Science
- Diamond Geezer
- Exploring East London
- Gödel's lost letter and P=NP
- Gil Kalai
- Haris Aziz
- Intersections
- Jane's London
- Jon Awbrey
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- Machines like us
- Marie Cameron's blog
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Paul Goldberg
- Robert A. Wilson's blog
- Sheila's blog
- Since it is not …
- Stubborn mule
- SymOmega
- Terry Tao
- The De Morgan Journal
- The London column
- The Lumber Room
- The matroid union
- Theorem of the day
- Tim Gowers
- XKCD

### Find me on the web

### Cameron Counts: RSS feeds

### Meta

# Tag Archives: primitive groups

## A thrifty algorithm

Two important classical parameters of a permutation group G of degree n are the base size, the smallest size of a collection of points whose pointwise stabiliser is the identity; and the minimal degree, the smallest number of points moved … Continue reading

Posted in exposition, open problems
Tagged base size, greedy algorithm, Kenneth Blaha, minimal degree, permutation groups, primitive groups
4 Comments

## 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