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

DOI10.1007/BF02582937zbMath0574.05041OpenAlexW2044649840MaRDI QIDQ1063005

Peter J. Cameron

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02582937

zbMATH Keywords

sum-free setsuniversal graphultrahomogeneous graphCyclic automorphisms

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Differential calculus on the space of countable labelled graphs, A solution to a problem of Cameron on sum-free complete sets, On the structure of a random sum-free set, Sum-free sets generated by the period-\(k\)-folding sequences and some Sturmian sequences, On the structure of a random sum-free set of positive integers, On the regular sum-free sets, Coloring of universal graphs

Cites Work

• There are four countable ultrahomogeneous graphs without triangles
• Countable Ultrahomogeneous Undirected Graphs
• Universal graphs and universal functions
• Asymmetric graphs
• A family of countable homogeneous graphs