Embedding graphs into larger graphs: results, methods, and problems

Abstract

10 E.g. we can put a i into A i if the smallest prime divisor of at is in (2 t , 2 t+1 ] and use a slight generalization of Theorem 2.4 to K(m, n).11 A longer annotated bibliography of O'Bryant can be downloaded from the Electronic Journal of Combinatorics [160] on Sidon sets.