Advanced search
Start date
Betweenand

Large substructures in random graphs and hypergraphs

Abstract

This grant will support the visit of Richard Lang, University of Heidelberg, Germany, to the Institute of Mathematics and Statistics of the University of São Paulo (IME/USP), from 1 March to 31 May 2022 (3 months). The visitor and members of the research group in combinatorics at IME/USP, including young researchers and students, will work on two classes of problems in the area of probabilistic combinatorics: (i) Dirac-type problems in the context of random hypergraphs, and (ii) problems involving monochromatic coverings of edge-coloured random graphs, inspired by problems of Ryser and Lovász. For (i), we shall consider approaches based on the regularity method, the absorption method and the method of templates, together with additional ideas developed by the visitor in joint work with Sanhueza-Matamala. For (ii), among others, approaches based on transversals of hypergraphs will be considered. The visitor will give talks on his recent work at USP and other institutions. (AU)

Articles published in Agência FAPESP Newsletter about the research grant:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Please report errors in scientific publications list by writing to: cdi@fapesp.br.