
doi: 10.37236/6308
We characterize the class of infinite graphs $G$ for which there exists a $T$-join for any choice of an infinite $T \subseteq V(G)$. We also show that the following well-known fact remains true in the infinite case. If $G$ is connected and does not contain a $T$-join, then it will if we either remove an arbitrary vertex from $T$ or add any new vertex to $T$.
Connectivity, Infinite graphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Paths and cycles, infinite graph, \(T\)-join
Connectivity, Infinite graphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Paths and cycles, infinite graph, \(T\)-join
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
