Common Multiples of Complete Graphs

A graph H is said to divide a graph G if there exists a setS of subgraphs of G, all isomorphic to H, such that the edgeset of G is partitioned by the edge sets of the subgraphs inS. Thus, a graph G is a common multiple of two graphs if eachof the two graphs divides G. This paper considers common multiples of a complete graph oforder m and a complete graph of order n. The complete graphof order n is denoted K_n. In particular, for all positive integersn, the set of integers q for which there exists a common multipleof K₃ and K_n having precisely q edges is determined. It is shown that there exists a common multiple of K₃ and K_nhaving q edges if and only if q 0 (mod 3), q 0 (mod n2) and (1) q 3 n2 when n 5 (mod 6); (2) q (n + 1) n2 when n is even; (3) q {36, 42, 48} when n = 4. The proof of this result uses a variety of techniques includingthe use of Johnson graphs, Skolem and Langford sequences, andequitable partial Steiner triple systems. 2000 MathematicalSubject Classification: 05C70, 05B30, 05B07.