Top Posts
Recent comments
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: trianglefree graphs
Old Codger’s Combinatorics Conference
Wednesday was the Old Codger’s Combinatorics Conference at the University of Reading, a oneday meeting organised by Anthony Hilton. The position of the apostrophe is correct: it refers to the fact that Anthony admits that he is an old codger … Continue reading
Guessing numbers of graphs
A paper, “Guessing games on trianglefree graphs”, by Anh Dang, Søren Riis, and me, has just appeared in the Electronic Journal of Combinatorics. Here is a brief discussion of what it is about. It is always a pleasant surprise when … Continue reading
Overload
Today is a bank holiday (even here in Scotland). I am sitting at home working. I have fallen so far behind that there is no alternative. Part of the trouble is that, over the next few months, I am giving … Continue reading
Posted in events, exposition
Tagged infinity, paradox, synchronization, the party problem, the random graph, trianglefree graphs, twographs
2 Comments