𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A correlation inequality for bipartite graphs

✍ Scribed by Alexander Sidorenko

Publisher
Springer Japan
Year
1993
Tongue
English
Weight
161 KB
Volume
9
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Packing two bipartite graphs into a comp
Packing two bipartite graphs into a complete bipartite graph
✍ Wang, Hong πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove

Packing bipartite graphs
Packing bipartite graphs
✍ A. Pawel Wojda; Paul Vaderlind πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 383 KB

For two bipartite graphs G = (L, R; E) and G' = (L', R'; E') a bijection f: LwR --\* L'uR' such that f(L) = L' is called hi-placement when f(u)f(v)~E', for every edge uv ~ E (then G and G' are called hi-placeable). We give new sufficient conditions for bipartite graphs G and G' to be bi-placeable.