𝔖 Bobbio Scriptorium
✦   LIBER   ✦

In search of an evolutionary edge: trading with a few, more, or many

✍ Scribed by Oded Stark; Doris A. Behrens


Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
316 KB
Volume
21
Category
Article
ISSN
0936-9937

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