The bounded-degree induced Menger conjecture
Statement
Let be a graph, let denote its maximum degree, and let . A set of vertices separates and if it intersects every --path; paths are pairwise at distance at least when their graph distance in is at least . The bounded-degree induced Menger conjecture. For every , there exists a constant such that, for every and every graph with , together with , there exists either
or a set of fewer than vertices in that separates and . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.