What’s not inside a Cayley graph

Abstract

There exist graphs of arbitrarily high girth and absolutely bounded degree which cannot be induced subgraphs of an irreducible Cayley graph.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    L. Babai, Chromatic Numbers and Subgraphs of Cayley Graphs, in:Proc. Conf. Graph Theory and Appl., Kalamazoo 1976 (Y. Alavi, D. R. Lick, eds.),Springer Lecture Notes (1978), 10–22.

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Spencer, J. What’s not inside a Cayley graph. Combinatorica 3, 239–241 (1983). https://doi.org/10.1007/BF02579297

Download citation

AMS subject classification (1980)

  • 05 C 25