ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let Δ(G)\Delta(G) denote its maximum degree, and let X,Y⊆V(G)X,Y\subseteq V(G). A set of vertices separates XX and YY if it intersects every XX-YY-path; paths are pairwise at distance at least dd when their graph distance in GG is at least dd. The bounded-degree induced Menger conjecture. For every d,Δ∈Nd,\Delta\in\mathbb{N}, there exists a constant C=C(d,Δ)>0C=C(d,\Delta)>0 such that, for every k∈Nk\in\mathbb{N} and every graph GG with Δ(G)≤Δ\Delta(G)\leq\Delta, together with X,Y⊆V(G)X,Y\subseteq V(G), there exists either

k X-Y-paths pairwise at distance at least d in G,k\text{ }X\text{-}Y\text{-paths pairwise at distance at least }d\text{ in }G,

or a set of fewer than CkCk vertices in GG that separates XX and YY. This is presented as a necessary consequence of the stronger coarse Menger conjecture of Albrechtsen et al. The source does not report a resolution of this bounded-degree formulation.

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.