We host a combinatorial seminar. A certain David is giving a talk on 1-factorisations of graphs. He makes the absurd claim that "It is hard to decide if a graph has a 1-factorisation." "Not cliques,
I tell the students in my topology class that we will have an aural final exam, or is it 'oral'? Both seem appropriate, but I'll go with 'aural'.
I'm talking with Jarik about polymorphisms. Me: We can always assume that they are idempotent. Bulatov Jeavons and Krohkin do this. Jarik: Then your essentially sub-unary automatically gives projective. Me: Yeah. Jarik: Then we have it.
Keevash gets the Birmingham post-doc. I get a NSERC post-doc fellowship. It easily beats the Korean one, but how do I convince Eunjoo of this? I will spend 2 years at SFU. Turns out that Eunjoo expected this,
I learn that Ross Kang, who was also at the Birmingham interviews, has got the NSERC post-doc fellowship that I am waiting to hear about. This disturbs me. There will probably be 200-300 of them given out, but
I fly to Birmingham for a interview to do a post-doc with Kuhn and Osthus. I have not been doing much extremal graph theory lately, having somehow transitioned to graph homomorphisms, but I could certainly stand to get
During a Sunday afternoon run I solve an open problem. I'm a genius. I get home and put on the coffee. I stand in the door frame basking in my cleverness. I notice a drop of
I get a offer for a one year post-doc at Sungkyunkwan University in Korea. The money isn't very good, but this is without teaching, so I could make it work. More importantly, it would make my
