Tag Archives: Laszlo Lovasz

Hoffman, Lovász and Haemers

Posted on 23/03/2021 by Peter Cameron

At the weekend I attended remotely a memorial session for Alan Hoffman, organised by Bill Pulleyblank. I found it informative, as well as moving. Hoffman is well-known in the algebraic graph theory community for a number of remarkable achievements, including … Continue reading →

Posted in events | Tagged , , , , , | 1 Comment

Erdos number website update

Posted on 03/08/2015 by Peter Cameron

The Erdős Number Project website, run by Jerry Grossman at Oakland University, has updated its data files, for the first time since 2010. Robert Bailey will be pleased, since he is now recognised as not the same person as Rosemary … Continue reading →

Posted in doing mathematics | Tagged , , , | Leave a comment

Limits

Posted on 13/08/2013 by Peter Cameron

I have just come to the end of the longest uninterrupted sequence of conferences I have ever had: five in a row, one of them a two-week conference. Since the start of July I have been at conferences in Egham, … Continue reading →

Posted in exposition | Tagged , , , , , , | 2 Comments

Homomorphisms modulo a prime

Posted on 03/12/2012 by Peter Cameron

Two of my colleagues have been doing interesting things with counting homomorphisms modulo a prime; Thomas Müller with group homomorphisms, and Mark Jerrum with graph homomorphisms. I may get round to discussing Thomas’s work later. Here I want to discuss … Continue reading →

Posted in exposition, mathematics | Tagged , , | 2 Comments

Graph limits and random graphs

Posted on 19/05/2011 by Peter Cameron

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 , , , , | Leave a comment