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

Peter J. Cameron

doi:10.1007/BF02582937

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

Peter J. Cameron^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	129-135
Number of pages	7
Journal	Graphs and Combinatorics
Volume	1
Issue number	1
DOIs	https://doi.org/10.1007/BF02582937
Publication status	Published - 1 Dec 1985

Access to Document

10.1007/BF02582937

Cite this

@article{707d0c7ea7b644168ffbc60ff6edf98a,

title = "Cyclic automorphisms of a countable graph and random sum-free sets",

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.",

author = "Cameron, {Peter J.}",

year = "1985",

month = dec,

day = "1",

doi = "10.1007/BF02582937",

language = "English",

volume = "1",

pages = "129--135",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer",

number = "1",

}

TY - JOUR

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

AU - Cameron, Peter J.

PY - 1985/12/1

Y1 - 1985/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=51249179231&partnerID=8YFLogxK

U2 - 10.1007/BF02582937

DO - 10.1007/BF02582937

M3 - Article

AN - SCOPUS:51249179231

SN - 0911-0119

VL - 1

SP - 129

EP - 135

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this