Category Archives: Extremal Combinatorics

Ryser’s conjecture

I am on a research visit in Rome, working with Valentina Pepe, and our joint paper on Ryser’s conjecture is on arXiv now. So this seems like the right time to talk about the conjecture and the problems related to … Continue reading

Posted in Combinatorics, Extremal Combinatorics, Finite Geometry, Incidence Geometry | Tagged , , , , , , , , | Leave a comment

Wenger graphs

A central (and foundational) question in extremal graph theory is the forbidden subgraph problem of Turán, which asks for the largest number of edges in an -vertex graph that does not contain any copy of a given graph as its … Continue reading

Posted in Combinatorics, Extremal Combinatorics, Finite Geometry, Incidence Geometry | Tagged , , , , , , , | Leave a comment

On a famous pigeonhole problem

After a short break from blogging, which involved moving from Ghent to Berlin, dealing with German bureaucracy, and learning how to make simple websites (the easiest bit), I am now back. I am working as a postdoc at the Free … Continue reading

Posted in Combinatorics, Extremal Combinatorics | Tagged , , , , | 5 Comments

The cage problem and generalized polygons (part 1)

This post is a continuation of my previous post on the cage problem. Just to recall the main problem, for any given integers and , we want to find the least number of vertices in a simple undirected graph which … Continue reading

Posted in Combinatorics, Extremal Combinatorics, Finite Geometry, Incidence Geometry, Spectral Graph Theory | Tagged , , , , | Leave a comment