Workshop on Ordered Combinatorial Structures

In extremal, probabilistic, and structural combinatorics, many objects and arguments possess natural orderings. For example, the Erdős–Hajnal stepping-up argument for hypergraph Ramsey numbers processes vertices one by one according to a fixed order. Similarly, the resolution of the Stanley–Wilf conjecture relies on 0–1 matrices, which may be viewed loosely as ordered analogues of bipartite graphs.

The workshop, as part of the Simons Semester in Ordered Combinatorics, will bring together leading experts and young researchers in extremal, probabilistic, and structural combinatorics. The goal is to share recent advances, identify new research directions, and foster collaboration between the above fields.