𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Phase Transitions on Markovian Bipartite Graphs—an Application of the Zero-range Process

✍ Scribed by Otto Pulkkinen; Juha Merikoski


Publisher
Springer
Year
2005
Tongue
English
Weight
255 KB
Volume
119
Category
Article
ISSN
0022-4715

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