Abstract:A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs has a long history in discrete mathematics, going back to the 18th century work of Euler on Latin squares. Since then rainbow structures were the focus of extensive research and found numerous applications in design theory and graph decompositions. Many problem...
Abstract A generalised pair is roughly a pair together with a nef divisor on a birational model. The theory of generalized pairs plays an important role in various aspects of birational geometry, such as the proof of the Borisov-Alexeev-Borisov conjecture. In this talk, I will discuss our recent works on the Kodaira vanishing theorem and the Kawamata-Viehweg vanishing theorem for lc generalized...