Geodesic
Graphs and models with finite chains
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 4 (2007), pp. 238-248

Voir la notice de l'article provenant de la source Math-Net.Ru

We investigate some properties of graphs with finite simple chains. In every countably categorical infinite graph there is a subgraph, which could be obtained from the infinite complete graph by the exshanging of some chains of the fixed lenght by edges. Classes of all graphs with finite chains and all finite graphs have the same elementary theory. The elementary theory of every graph of the finite lenght desidable. At the end we also introduce the notion. Of the graph of an arbitrary structure and shows that all obtained facts remaines true for classes of structures which graphs have prescribed properties. 
@article{SEMR_2007_4_a13,
     author = {A. T. Nurtazin},
     title = {Graphs and models with finite chains},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {238--248},
     publisher = {mathdoc},
     volume = {4},
     year = {2007},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2007_4_a13/}
}
TY  - JOUR
AU  - A. T. Nurtazin
TI  - Graphs and models with finite chains
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2007
SP  - 238
EP  - 248
VL  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2007_4_a13/
LA  - ru
ID  - SEMR_2007_4_a13
ER  - 
%0 Journal Article
%A A. T. Nurtazin
%T Graphs and models with finite chains
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2007
%P 238-248
%V 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2007_4_a13/
%G ru
%F SEMR_2007_4_a13
A. T. Nurtazin. Graphs and models with finite chains. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 4 (2007), pp. 238-248. http://geodesic.mathdoc.fr/item/SEMR_2007_4_a13/