Embedding, randomised and structural problems in extremal graph theory
Grant number: | 13/11431-2 |
Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
Start date: | September 01, 2013 |
End date: | May 10, 2017 |
Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Computational Mathematics |
Principal Investigator: | Yoshiharu Kohayakawa |
Grantee: | Guilherme Oliveira Mota |
Host Institution: | Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil |
Associated scholarship(s): | 13/20733-2 - Extremal and probabilistic combinatorics, BE.EP.PD |
Abstract This is the research project to the postdoc of Guilherme Oliveira Mota, to be developed under the supervision of Y.~Kohayakawa, at the "Instituto de Matemática e Esatística", USP, from 1/9/2013 to 31/8/2015. This project is focused on achieving significant advances in several problems of the area of extremal and probabilistic combinatorics. The subjects of the problems that will be attacked in this postdoc project are the following: 1. embedding of spanning trees in random graphs; 2. Ramsey Theory; 3. regularity in hypergraphs; 4. structure of dense graphs with large girth; 5. Turán type problems. | |
News published in Agência FAPESP Newsletter about the scholarship: | |
More itemsLess items | |
TITULO | |
Articles published in other media outlets ( ): | |
More itemsLess items | |
VEICULO: TITULO (DATA) | |
VEICULO: TITULO (DATA) | |