I would like to draw your attention to the PhD program in Mathematics at the University of Torino, Italy, and specifically to the possibility of a PhD on Planar Graphs and Polyhedra, supervised by me in Torino, and with a semester and visits abroad.
The call is expected to be advertised in April, with deadline in early June, and starting November.
Criteria
1) The successful candidate will have a master's degree (or be very close to obtaining one--usually end of October is the cut-off date) in mathematics (or closely related subject) with top grades. If the candidate has a bachelor's degree, this should be with top grades as well. Moreover transcripts should contain exams related to the sought PhD topic, also with top grades.
"top grades" is to be interpreted as above 95% equivalent, as candidates who fall below are not likely to be successful as these PhDs are usually very competitive.
2) The successful candidate will also have at least two (preferably more) of the following:
(peer-reviewed, good quality) publication(s) relevant to the sought PhD topic
academic references relevant to the sought PhD topic
participation in training "schools" (summer schools...)
university semester abroad (such as Erasmus)
excellence programs (such as Scuola Normale di Pisa)
prizes
3) Interest and some expertise in graph theory, specifically one or more of the following: planar graphs, vertex degree sequences, structural properties of graphs, algorithms for graphs, extremal graph theory.
Candidates who meet the above criteria are very welcome to contact me for further details.
Please forward this email to anyone who might be interested.
Kind regards,
Riccardo Maffucci
University of Torino
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
