On packing bipartite graphs (Q1200276): Difference between revisions

Two simple graphs \(G\) and \(H\) can be packed if \(G\) is isomorphic to a subgraph of the complement \(\overline H\) of \(H\). A sufficient condition is known for the existence of packing in terms of the product of the maximal degrees of \(G\) and \(H\). The paper improves this result for bipartite graphs by presenting a condition involving products of a maximum degree with an average degree, which guarantees a packing of the two bipartite graphs.