UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Sieve methods in combinatorics

Thumbnail Image

Files

28-published.pdf (276.84 KB)

Date

2005-07

Authors

Liu, Yu-Ru
Murty, M. Ram

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

Abstract

We develop the Turán sieve and a ‘simple sieve’ in the context of bipartite graphs and apply them to various problems in combinatorics. More precisely, we provide applications in the cases of characters of abelian groups, vertex-colourings of graphs, Latin squares, connected graphs, and generators of groups. In addition, we give a spectral interpretation of the Turán sieve.

Description

This article is made available through Elsevier's open archive. This article is available here: https://doi.org/10.1016/j.jcta.2004.11.004 © 2004 Elsevier Inc. All rights reserved.

Keywords

Turan sieve, simple sieve, combinatorial sieve

LC Keywords

Citation

URI

https://doi.org/10.1016/j.jcta.2004.11.004
 http://hdl.handle.net/10012/19982

Collections

Waterloo Research