Homogeneous embeddings of cycles in graphs
If \(G\) and \(H\) are vertex-transitive graphs, then the framing number \(\text{fr}(G, H)\) of \(G\) and \(H\) is defined as the minimum order of a graph every vertex of which belongs to an induced \(G\) and an induced \(H\). This paper investigates \(\text{fr}(C_m, C_n)\) for \(m < n\). The authors show first that \(\text{fr}(C_m, C_n) \geq n + 2\) and determine when equality occurs. Thereafter they establish general lower and upper bounds which show that \(\text{fr}(C_m, C_n)\) is approximately the minimum of \(n - m + 2\sqrt{n}\) and \(n + \frac{n}{m}\).
scientific article; zbMATH DE number 1332849