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

An example of a polarized K3 surface with elliptic free Clifford divisors

โœ Scribed by Kenta Watanabe


Book ID
105756118
Publisher
Springer
Year
2011
Tongue
English
Weight
166 KB
Volume
97
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Tight upper bound on the number of edges
โœ 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