Sciact
  • EN
  • RU

Approximations of regular graphs Full article

Journal Вестник Казахстанско-Британского технического университета
ISSN: 1998-6688 , E-ISSN: 2959-8109
Output data Year: 2022, Volume: 19, Number: 1, Pages: 44-49 Pages count : 6 DOI: 10.55452/1998-6688-2022-19-1-44-49
Tags regular graph, approximation of a theory, pseudofinite theory
Authors Мархабатов Н.Д. 1 , Sudoplatov Sergei Vladimirovich 1,2,3
Affiliations
1 Novosibirsk State Technical University
2 Sobolev Institute of Mathematics
3 Novosibirsk State University

Funding (1)

1 Sobolev Institute of Mathematics FWNF-2022-0012

Abstract: The paper [11] raised the question of describing the cardinality and types of approximations for natural families of theories. In the present paper, a partial answer to this question is given, and the study of approximation and topological properties of natural classes of theories is also continued. We consider a cycle graph consisting of one cycle or, in other words, a certain number of vertices (at least 3 if the graph is simple) connected into a closed chain. It is shown that an infinite cycle graph is approximated by finite cycle graphs. Approximations of regular graphs by finite regular graphs are considered. On the other hand, approximations of acyclic regular graphs by finite regular graphs are considered. It is proved that any infinite regular graph is pseudofinite. And also, for any k, any k-regular graph is homogeneous and pseudofinite. Examples of pseudofinite 3-regular and 4-regular graphs are given.
Cite: Мархабатов Н.Д. , Sudoplatov S.V.
Approximations of regular graphs
Вестник Казахстанско-Британского технического университета. 2022. V.19. N1. P.44-49. DOI: 10.55452/1998-6688-2022-19-1-44-49 РИНЦ OpenAlex
Dates:
Submitted: Jan 10, 2022
Published online: Mar 1, 2022
Identifiers:
Elibrary: 58141337
OpenAlex: W4224124079
Citing:
DB Citing
OpenAlex 1
Altmetrics: