A class of additive multiplicative graph
โ
Lih-Hsing Hsu; Chiuyuan Chen; En-Yih Jean
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 650 KB
For a fixed graph G, the capacity function for G, Po, is defined by Pc(H)= lim,\_\_,ยฎ[yo(H')] TM, where y6(H) is the maximum number of disjoint G's in H. In , Hsu proved that Pr2 can be viewed as a lower bound for multiplicative increasing graph functions. But it was not known whether Pr2 is multipl