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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.