Bowtie-free graphs and generic automorphisms
Logic
2023-04-06 v2 Combinatorics
Abstract
We show that the countable universal omega-categorical bowtie-free graph admits generic automorphisms. Moreover, we show that this graph is not finitely homogenisable.
Keywords
Cite
@article{arxiv.1705.01347,
title = {Bowtie-free graphs and generic automorphisms},
author = {Daoud Siniora},
journal= {arXiv preprint arXiv:1705.01347},
year = {2023}
}
Comments
14 pages