The Lovász–Cherkassky theorem in infinite graphs
Abstract Infinite generalizations of theorems in finite combinatorics were initiated by Erdős due to his famous Erdős–Menger conjecture (now known as the Aharoni–Berger theorem) that extends Menger's theorem to infinite graphs in a structural way. We prove a generalization of this manner of the...
| 發表在: | Transactions of the London Mathematical Society |
|---|---|
| 主要作者: | |
| 格式: | Article |
| 語言: | 英语 |
| 出版: |
Wiley
2024-12-01
|
| 在線閱讀: | https://doi.org/10.1112/tlm3.70001 |