Approximations of Acyclic Graphs

被引:1
|
作者
Markhabatov, Nurlan D. [1 ]
机构
[1] Novosibirsk State Tech Univ, Novosibirsk 630073, Russia
关键词
approximation of theory; tree; acyclic graph; pseudofinite theory;
D O I
10.26516/1997-7670.2022.40.104
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, approximations of acyclic graphs are studied. It is proved that any theory of an acyclic graph (tree) of finite diameter is pseudofinite with respect to acyclic graphs (trees), that is, any such theory is approximated by theories of finite structures (acyclic graphs, trees). It is also proved that an acyclic graph of infinite diameter with infinite number of rays is pseudofinite.
引用
收藏
页码:104 / 111
页数:8
相关论文
共 50 条
  • [1] Approximations of Acyclic Graphs
    Markhabatov, Nurlan D.
    [J]. BULLETIN OF IRKUTSK STATE UNIVERSITY-SERIES MATHEMATICS, 2022, 40 : 104 - 111
  • [2] Totally Acyclic Approximations
    Petter A. Bergh
    David A. Jorgensen
    W. Frank Moore
    [J]. Applied Categorical Structures, 2021, 29 : 729 - 745
  • [3] Totally Acyclic Approximations
    Bergh, Petter A.
    Jorgensen, David A.
    Moore, W. Frank
    [J]. APPLIED CATEGORICAL STRUCTURES, 2021, 29 (04) : 729 - 745
  • [4] Mean square cordial labelling related to some acyclic graphs and its rough approximations
    Dhanalakshmi, S.
    Parvathi, N.
    [J]. PROCEEDINGS OF THE 10TH NATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND ITS APPLICATIONS (NCMTA 18), 2018, 1000
  • [5] ACYCLIC COLORING OF GRAPHS
    ALON, N
    MCDIARMID, C
    REED, B
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1991, 2 (03) : 277 - 288
  • [6] On Acyclic Colorings of Graphs
    Ahmed, Abu Reyan
    Islam, Md Mazharul
    Rahman, Md Saidur
    [J]. 2012 15TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT), 2012, : 95 - 100
  • [7] Acyclic Partitioning of Large Directed Acyclic Graphs
    Herrmann, Julien
    Kho, Jonathan
    Ucar, Bora
    Kaya, Kamer
    Catalyurek, Umit V.
    [J]. 2017 17TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2017, : 371 - 380
  • [8] Acyclic polynomials of graphs
    Barton, Caroline
    Brown, Jason, I
    Pike, David A.
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2022, 82 : 146 - 181
  • [9] Counting acyclic orderings in directed acyclic graphs
    Fox, Joseph
    Judd, Aimee
    [J]. Journal of Combinatorial Mathematics and Combinatorial Computing, 2020, 115 : 271 - 286
  • [10] On the acyclic choosability of graphs
    Montassier, M
    Ochem, P
    Raspaud, A
    [J]. JOURNAL OF GRAPH THEORY, 2006, 51 (04) : 281 - 300