Skip to main content
SpringerLink
Log in

Cyclic automorphisms of a countable graph and random sum-free sets

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Cyclic automorphisms of the countable universal ultrahomogeneous graph are investigated using methods of Baire category and measure theory. This leads to the study of random sumfree sets; it is shown that the probability that such a set consists entirely of odd numbers is strictly positive, and bounds are given.

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. Covington, J.: Dissertation, Oxford 1984

  2. Erods, P., Rényi, A.: Asymmetric graphs. Acta Math. Acad. Sci. Hungar.14, 295–315 (1963)

    Article  MathSciNet  Google Scholar 

  3. Lachlan, A.H., Woodrow, R.E.: Countable homogeneous undirected graphs. Trans. Amer. Math. Soc.262, 51–94 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Rado, R.: Universal graphs and universal functions. Acta Arith9, 331–340 (1964)

    MATH  MathSciNet  Google Scholar 

  5. Woodrow, R.E.: There are exactly four countable ultrahomogeneous graphs without triangles. J. Comb. Theory (B)27, 168–179 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  6. Henson, C.W.: A family of countable homogeneous graphs. Pacific J. Math.38, 69–83 (1971)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Merton College, OX1 4JD, Oxford, England

    Peter J. Cameron

  2. California Institute of Technology, 91125, Pasadena, CA, USA

    Peter J. Cameron

Authors
  1. Peter J. Cameron
    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

Cameron, P.J. Cyclic automorphisms of a countable graph and random sum-free sets. Graphs and Combinatorics 1, 129–135 (1985). https://doi.org/10.1007/BF02582937

Download citation

  • Issue Date:

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

Keywords

Search

Navigation