The augmenting-path meta-conjecture for infinite structures

From papers

Consider theorems about finite combinatorial structures that admit proofs by augmenting paths. Augmenting-path meta-conjecture. Such theorems should remain true in a structural form for infinite structures, possibly under some restrictions. This principle is motivated by infinite structural generalizations of finite results including Menger's theorem, the Ford–Fulkerson theorem, Tutte's matching theorem, Edmonds' matroid intersection theorem, and the Lovász–Cherkassky theorem. The source describes it as a somewhat vague meta-conjecture and gives no general proof or resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Attila Joó, “The Lovász-Cherkassky theorem in infinite graphs”, arXiv:2311.06611 (2023).

Solutions 0

No solutions have been posted yet.