Bowtie-free graphs and generic automorphisms
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2017
- DOI:
- 10.48550/arXiv.1705.01347
- arXiv:
- arXiv:1705.01347
- Bibcode:
- 2017arXiv170501347S
- Keywords:
-
- Mathematics - Logic;
- Mathematics - Combinatorics;
- 20B27;
- 03C15;
- 05C25;
- 05C75;
- 54H11
- E-Print:
- 14 pages