A Note on Pseudofinite Acyclic Graphs

Acyclic graphs approximated by finite acyclic graphs are considered. It is proved that any countably categorical acyclic graph is smoothly approximable. An example of pseudofinite acyclic graph theory is given, which has an even, odd, and infinite number of rays.

Bibliografiska uppgifter
Huvudupphovsmän: N. D. Markhabatov, Ye. R. Baissalov
Materialtyp: Artikel
Språk:English
Publicerad: Irkutsk State University 2024-12-01
Serie:Известия Иркутского государственного университета: Серия "Математика"
Ämnen:
Länkar:https://mathizv.isu.ru/en/article/file?id=1513