A note on pseudofinite acyclic graphs
From MaRDI portal
Publication:6663877
DOI10.26516/1997-7670.2024.50.116MaRDI QIDQ6663877
Erzhan Rakhmettollaevich Baĭsalov, Nurlan Darkhanovich Markhabatov
Publication date: 15 January 2025
Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)
treeacyclic graphapproximation of theorypseudofinite theorypseudofinite graphsmoothly approximated structure
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Models with special properties (saturated, rigid, etc.) (03C50)
Cites Work
- Unnamed Item
- Approximations of theories
- Approximations of acyclic graphs
- Pseudofiniteness in Hrushovski constructions
- Strict superstablity and decidability of certain generic graphs
- Generic theories as a method for approximating elementary theories
- Graphs and models with finite chains
- Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets
- Superstable graphs
- ℵ0 -Categorical Structures Smoothly Approximated by Finite Substructures
- Stable graphs
- Model Theory
- Kinds of pregeometries of acyclic theories
This page was built for publication: A note on pseudofinite acyclic graphs