*This event is in-person and open only to Princeton University ID holders*

Decomposition problems make one of the most classical classes of combinatorial questions with many connections and applications to other fields. In this talk I will discuss recent progress on two classical conjectures in the area, namely Rota's basis conjecture and the Erd\H{o}s-Gallai conjecture.

Rota's basis conjecture in a simplified form asserts that given nn disjoint bases in a vector space of dimension nn we can decompose the elements making the bases into nn so called transversal bases, namely bases which intersect each original basis in exactly one element. This conjecture has attracted a lot of attention over the years due to its numerous connections to other topics and in particular recently when it was the subject of the 12th Polymath project. In its full generality the conjecture extends to the setting of matroids, important algebraic objects generalizing the notion of vector spaces.

The Erd\H{o}s-Gallai conjecture dating back to the 1960s is one of the most classical conjectures in the area of graph decomposition problems and has attracted a lot of attention over the years. It asserts that any graph on nn vertices can be decomposed into O(n)O(n) cycles and edges. Based on joint work with Kwan, Pokrovskiy and Sudakov and Montgomery.