Find me on the web
Tag Archives: Peter Keevash
A great number of mathematical problems amount to looking in a large but highly structured graph, and finding a complete or null subgraph of largest possible size there. For a simple example, consider Latin squares of order n. One of … Continue reading
Today a paper by Mohammed Aljohani, John Bamberg and me went on the arXiv on this topic. Here is a brief summary of what it is about. Synchronization comes in several flavours, and the point of the paper is to … Continue reading
This picture (courtesy of Sebi Cioabă) shows Peter Keevash with the diagram which illustrates the proof strategy for his theorem. Perhaps it will be helpful, especially to those who heard the lecture (or similar lectures elsewhere). Thanks Sebi!
Today Peter Keevash finished four and a half hours of lectures on his latest improvement of his result on the existence of designs. I have heard him talk on this before, but in a one-hour talk he had time to … Continue reading
Following Peter Keevash’s asymptotic existence proof for Steiner systems, does anything remain to be done? I would say yes, it certainly does; here are a few thoughts about the open problems in this area. Existence We are looking for a … Continue reading