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: Endre Szemeredi
London Combinatorics Colloquia, 2
It’s that time of year again, and while I miss the buttercups in Reading, we had as usual a feast of interesting mathematics and a large and enthusiastic audience. It was a bit more tightly focussed than I would have … Continue reading
Posted in events, exposition
Tagged amenability, Ben Green, Cayley graphs, Endre Szemeredi, Gabor Kun, Noga Alon, Norman Biggs, Regularity Lemma, sum-free sets
Leave a comment
London Combinatorics Colloquia
This week saw the two linked London Combinatorics Colloquia, at Queen Mary and the London School of Economics. Not so long ago, a one-day meeting in Reading organised by Anthony Hilton was a fixture of the calendar. When Anthony came … Continue reading
A literary-mathematical puzzle
In 1968, Stanislaw Lem, the great Polish science-fiction writer, published a book entitled Głos Pana. It was translated into English and published under the title His Master’s Voice in 1983. It tells the story of how a message from an … Continue reading
Posted in books, history
Tagged combinatorics, Endre Szemeredi, ergodic theory, Hillel Furstenberg, Stanislaw Lem
2 Comments
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