IfY is a finite graph then it is known that every sufficiently large groupG has a Cayley graph containing an induced subgraph isomorphic toY. This raises the question as to what is “sufficiently large”. Babai and Sós have used a probabilistic argument to show that |G| > 9.5 |Y|3 suffices. Using a form of greedy algorithm we strengthen this to\(|G| > (2 + \sqrt 3 )|Y|^3 \). Some related results on finite and infinite groups are included.
KeywordsGreedy Algorithm Related Result Cayley Graph Finite Graph Probabilistic Argument
Unable to display preview. Download preview PDF.
- 1.Babai, L.: Embedding graphs in Cayley graphs. In: Probl. Comb. Théorie des Graphes (Proc. Conf. Paris-Orsay 1976) edited by J-C. Bermond, et al., pp. 13–15. Paris: C.N.R.S. 1976.Google Scholar
- 2.Babai, L., Sós, V.T.: Sidon sets in groups and induced subgraphs of Cayley graphs. Europ. J. Comb. (to appear)Google Scholar