๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Applications of the Hardy-Littlewood Method || On the Exponential Sum over k-Free Numbers

โœ Scribed by J. Brudern, A. Granville, A. Perelli, R. C. Vaughan and T. D. Wooley

Book ID
123646238
Publisher
The Royal Society
Year
1998
Tongue
English
Weight
518 KB
Volume
356
Category
Article
ISSN
0264-3952

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Tight upper bound on the number of edges
Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application
โœ Zhi-Zhong Chen; Shiqing Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 68 KB

We show that an n-vertex bipartite K 3,3 -free graph with n 3 has at most 2n -4 edges and that an n-vertex bipartite K 5 -free graph with n 5 has at most 3n -9 edges. These bounds are also tight. We then use the bound on the number of edges in a K 3,3 -free graph to extend two known NC algorithms fo