共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
3.
4.
Zvonko Iljazović 《Mathematical Logic Quarterly》2020,66(1):51-64
We consider topological pairs , , which have computable type, which means that they have the following property: if X is a computable topological space and a topological imbedding such that and are semicomputable sets in X, then is a computable set in X. It is known, e.g., that has computable type if M is a compact manifold with boundary. In this paper we examine topological spaces called graphs and we show that we can in a natural way associate to each graph G a discrete subspace E so that has computable type. Furthermore, we use this result to conclude that certain noncompact semicomputable graphs in computable metric spaces are computable. 相似文献
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
The distinguishing index of a graph is the least cardinal number such that has an edge-coloring with colors, which is preserved only by the trivial automorphism. We prove a general upper bound for any connected infinite graph with finite maximum degree . This is in contrast with finite graphs since for every there exist infinitely many connected, finite graphs with . We also give examples showing that this bound is sharp for any maximum degree . 相似文献