A Note on Pseudofinite Acyclic Graphs

dc.contributor.author	Markhabatov, Nurlan D.
dc.contributor.author	Baissalov, Yerzhan R.
dc.date.accessioned	2026-03-25T10:42:42Z
dc.date.available	2026-03-25T10:42:42Z
dc.date.issued	2024
dc.identifier.issn	2541-8785
dc.identifier.other	doi.org/10.26516/1997-7670.2024.50.116
dc.identifier.uri	http://repository.enu.kz/handle/enu/30652
dc.description.abstract	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.	ru
dc.language.iso	en	ru
dc.publisher	THE BULLETIN OF IRKUTSK STATE UNIVERSITY». SERIES «MATHEMATICS	ru
dc.relation.ispartofseries	Т. 50. С. 116—124;
dc.subject	approximation of theory	ru
dc.subject	tree	ru
dc.subject	acyclic graph	ru
dc.subject	pseudofinite theory	ru
dc.subject	smoothly approximated structure	ru
dc.subject	pseudofinite graph	ru
dc.title	A Note on Pseudofinite Acyclic Graphs	ru
dc.type	Article	ru