Skip to main content
SpringerLink
Log in

What’s not inside a Cayley graph

  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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

Authors and Affiliations

  1. Department of Mathematics, State University of New York, 11794, Stony Brook, N. Y., U.S.A.

    Joel Spencer

Authors
  1. Joel Spencer
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579297

AMS subject classification (1980)

Search

Navigation