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

DOI10.1007/BF02582937zbMATH Open0574.05041OpenAlexW2044649840MaRDI QIDQ1063005FDOQ1063005

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

Recommendations

• scientific article; zbMATH DE number 3893250
• Graphs omitting a finite set of cycles
• Properties of the automorphism group and a probabilistic construction of a class of countable labeled structures
• Measures on the Random Graph
• The group of almost automorphisms of the countable universal graph

zbMATH Keywords

sum-free setsuniversal graphultrahomogeneous graphCyclic automorphisms

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

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

Cited In (7)

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

This page was built for publication: Cyclic automorphisms of a countable graph and random sum-free sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063005)