Problems in discrete probability, extremal set theory and extremal graph theory
Grant number: | 10/09555-7 |
Support type: | Scholarships in Brazil - Post-Doctorate |
Effective date (Start): | September 01, 2010 |
Effective date (End): | December 31, 2011 |
Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Computational Mathematics |
Principal researcher: | Yoshiharu Kohayakawa |
Grantee: | Peter David Allen |
Home Institution: | Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil |
Abstract This is a proposal for a postdoctoral fellowship for Peter David Allen, to be held at the Institute of Mathematics and Statistics of the University of São Paulo (IME/USP), from 6 September 2010, initially proposed for 24 months. This researcher will be a member of the combinatorics and theory group at IME/USP and of NUMEC, Núcleo de Modelagem Estocástica e Complexidade, a research centre of USP.Research in four directions in extremal graph theory is proposed: (i) extremal conditions for the existence of large subgraphs, (ii) randomised restrictions in extremal combinatorics, (iii) progress towards a regularity-free embedding method, (iv) structural and limits theory for dense K_{s,t}-free graphs. | |
News published in Agência FAPESP Newsletter about the scholarship: | |
TITULO | |
Articles published in other media outlets (0 total): | |
More itemsLess items | |
VEICULO: TITULO (DATA) | |
VEICULO: TITULO (DATA) | |