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

### Cameron Counts: RSS feeds

### Meta

# Tag Archives: Laszlo Lovasz

## Hoffman, Lovász and Haemers

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 Alan Hoffman, algebraic graph theory, eigenvalues, Laszlo Lovasz, optimization, WIllem Haemers
1 Comment

## Erdos number website update

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 Jerry Grossman, Laszlo Lovasz, Robert Bailey, Vojtech Rodl
Leave a comment

## Limits

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 Anatoly Vershik, Dan Kral, graph limits, graphons, Laszlo Lovasz, permutons, random graphs
2 Comments

## Homomorphisms modulo a prime

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

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