ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.