Embedding, randomised and structural problems in extremal graph theory
Problems in discrete probability, extremal set theory and extremal graph theory
Quasi-random hypergraphs and spanning subhypergraph containment
Grant number: | 13/20733-2 |
Support type: | Scholarships abroad - Research Internship - Post-doctor |
Effective date (Start): | January 02, 2015 |
Effective date (End): | January 01, 2016 |
Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Computational Mathematics |
Principal Investigator: | Yoshiharu Kohayakawa |
Grantee: | Guilherme Oliveira Mota |
Supervisor abroad: | Mathias Schacht |
Home Institution: | Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil |
Local de pesquisa : | Universität Hamburg (UHH), Germany |
Associated to the scholarship: | 13/11431-2 - Extremal and probabilistic combinatorics, BP.PD |
Abstract This is the research project for Guilherme Oliveira Mota, a postdoctoral student under the supervision of Y. Kohayakawa at the Instituto de Matemática e Estatística (USP) and a scholar of FAPESP (Proc. 2013/11431-2), to spend twelve months of his postdoctoral studies with research groups at Hamburg Universität. His stay is planned for the period of 01/12/2014 to 30/11/2015. The researcher who will supervise this student is Mathias Schacht. The postdoctoral project of this student aims to contribute to the development of the extremal and probabilistic combinatorics. The candidate will study problems related to the embedding of spanning trees in random graphs, hypergraph regularity and the structure of dense graphs with large girth. (AU) | |