𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tight Bounds for Testing Bipartiteness in General Graphs

✍ Scribed by Kaufman, Tali; Krivelevich, Michael; Ron, Dana

Book ID
118181274
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
448 KB
Volume
33
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generating strings for bipartite Steinha
Generating strings for bipartite Steinhaus graphs
✍ Wayne M. Dymàček; Tom Whaley πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 473 KB

Let b(n) be the number of bipartite Steinhaus graphs with n vertices. We show that bin) satisfies the recurrence, b(2)=2, b(3)=4, and for k>~2, b(2k+ 1)=2b(k+ 1)+ 1, b(2k) = b(k) + b(k + 1). Thus b(n) <<, ~zn -~ with equality when n is one more than a power of two. To prove this recurrence, we descr

Nearly Tight Bounds for Testing Function
Nearly Tight Bounds for Testing Function Isomorphism
✍ Alon, Noga; Blais, Eric; Chakraborty, Sourav; GarcΓ­a-Soriano, David; Matsliah, A πŸ“‚ Article πŸ“… 2013 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 470 KB