The Libraries will be performing routine maintenance on UWSpace on October 20th, 2025, from 10:00-10:30 pm ET. UWSpace will be unavailable during this time. Service should resume by 10:30 pm ET.
 

Sieve methods in combinatorics

Loading...
Thumbnail Image

Date

2005-07

Authors

Liu, Yu-Ru
Murty, M. Ram

Advisor

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 Subject Headings

Citation