Top Posts
Recent comments
- dsp on The enhanced power graph is weakly perfect
- dsp on The enhanced power graph is weakly perfect
- What Lovelace Did: From Bombelli to Bernoulli to Babbage | on Polynomials taking integer values
- What Ada Did: From Bombelli to Bernoulli to Babbage | on Polynomials taking integer values
- Peter Cameron on The enhanced power graph is weakly perfect
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 659 other followers
Cameron Counts: RSS feeds
Meta
Tag Archives: Ramsey’s theorem
Combinatorics in Scotland, group theory in Portugal
I never really wanted to retire. For various reasons which no longer matter, I decided to retire from my position at Queen Mary, University of London, on turning 65 two years ago. I hoped that I would find enough to … Continue reading
Partitions into Petersens
There is a lovely algebraic argument to prove that the complete graph on ten vertices (which has 45 edges) cannot be partitioned into three copies of the Petersen graph (which has 15 edges). Sebastian Cioaba asked me: for which m … Continue reading
Posted in exposition, open problems
Tagged doubly transitive groups, eigenvalues, Ramsey's theorem
10 Comments
Peter Cameron's Blog 