T-joins in infinite graphs

MaRDI QIDQ2363692zbMATH OpenFDO

Authors Attila Joó

Publication date 26 July 2017

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p2

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

\(T\)-joininfinite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

Summary: 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\).

Recommendations

• T‐joins intersecting small edge‐cuts in graphs
• scientific article; zbMATH DE number 927076
• Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts
• scientific article; zbMATH DE number 1757969
• Minimum \(T\)-joins and signed-circuit covering

Cites work

• Elementary submodels in infinite combinatorics
• scientific article; zbMATH DE number 878892 (Why is no real title available?)
• Set theory.

Cited in

(3)

• The Lovász-Cherkassky theorem in countable graphs
• T-joins in strongly connected hypergraphs
• scientific article; zbMATH DE number 7310226 (Why is no real title available?)

This page was built for publication: \(T\)-joins in infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363692)