Discrete Mathematics

Upcoming events

The approximate structure of triangle-free graphs

A natural way of constructing a dense triangle-free graph is to start with a triangle-free graph $G_0$ of bounded size, blow it up, and then delete some edges. Many of the natural triangle-free graphs we encounter, such as…

12-05-202512-05-2025

With: Yuval Wigderson
Place and room: CM 1 517
Category: Conferences – Seminars

See all events

Past events

Zarankiewicz's problem in hereditary families of graphs, with geometric applications

Zarankiewicz's problem is one of the central problems in extremal graph theory, and it asks for the maximum number of edges in a bipartite graph with vertex classes of size n, which does not contain the complete bipartite…

14-04-202514-04-2025

With: Aleksa Milojevic – ETH Zurich
Place and room: CM 1 517
Category: Conferences – Seminars

See all events