Homogeneous Embeddings of Cycles in Graphs


If G and H are vertex-transitive graphs, then the framing number 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 fr(Cm, Cn) for m < n. We show first that fr(Cm, Cn) ≥ n+2 and determine when equality occurs. Thereafter we establish general lower and upper… (More)
DOI: 10.1007/s003730050050


1 Figure or Table