T-joins in in nite graphs

We characterize the class of in nite graphs G for which there exists a T -join for any choice of an in nite T ⊆ V (G). We also show that the following wellknown fact remains true in the in nite 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 .