|
Organizers |
Sieve Methods in Combinatorics
by
Ram Murty
Queen's University
Coauthors: Yu-Ru Liu
We will present a combinatorial analogue of a sieve method originating in a 1934 paper of Paul Turan which we call the Turan sieve. The advantage of the Turan sieve is that it is "Mobius function free". Thus, in a combinatorial setting, this sieve method has wider applications and we explore some of these, such as getting good estimates for the number of proper colorings of the vertices of a graph.
Date received: May 18, 2004
Copyright © 2004 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Mathematical Conference Abstracts. Document # caok-42.