| dc.contributor.author | Liu, Yu-Ru | |
| dc.contributor.author | Murty, M. Ram | |
| dc.date.accessioned | 2023-10-03 14:51:20 (GMT) | |
| dc.date.available | 2023-10-03 14:51:20 (GMT) | |
| dc.date.issued | 2005-07 | |
| dc.identifier.uri | https://doi.org/10.1016/j.jcta.2004.11.004 | |
| dc.identifier.uri | http://hdl.handle.net/10012/19982 | |
| dc.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. | en |
| dc.description.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. | en |
| dc.description.sponsorship | This work is partially supported by an NSERC Discovery Grant. | en |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.relation.ispartofseries | Journal of Combinatorial Theory, Series A;111(11) | |
| dc.subject | Turan sieve | en |
| dc.subject | simple sieve | en |
| dc.subject | combinatorial sieve | en |
| dc.title | Sieve methods in combinatorics | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Liu, Y.-R., & Murty, M. R. (2005). Sieve methods in combinatorics. Journal of Combinatorial Theory, Series A, 111(1), 1–23. https://doi.org/10.1016/j.jcta.2004.11.004 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Pure Mathematics | en |
| uws.typeOfResource | Text | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
