The School of Mathematics & Statistics, UNSW is seeking an enthusiastic and suitably qualified person to undertake research on an ARC-funded project entitled "Extremal Problems in Hypergraph Matchings". The successful applicant will work under the supervision of Dr Catherine Greenhill and will focus on asymptotic and probabilistic aspects of the project (involving random hypergraphs, random matchings and asymptotic enumeration).
Applicants should have a mathematics or theoretical computer science PhD in an area related to graph theory or combinatorics. Applicants should also be active researchers with good written and oral communication skills, and the ability to work effectively both independently and in a team.
Experience in asymptotic, algorithmic or probabilistic combinatorics is desirable but not essential.
For full details of this position and the application procedure, see
http://www.hr.unsw.edu.au/services/recruitment/jobs/22061202.html
Applications close: 10 August 2012
--
School of Mathematics and Statistics Phone: +61 2 9385 7105
University of New South Wales Fax: +61 2 9385 7123
Sydney 2052 http://web.maths.unsw.edu.au/~csg
AUSTRALIA UNSW CRICOS code 00098G
**********************************************************
*
* 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/
*
**********************************************************