István Tomon gave an online talk on semilinear graphs at the Discrete Math Seminar

On April 14, 2021, István Tomon from the ETH Zurich gave an online talk at the Virtual Discrete Math Colloquium on the size of the maximum clique, the size of the maximum independent set, and the chromatic number of a semilinear graph of bounded complexity. The title of his talk was “Ramsey properties of semilinear graphs“.