Erdős Problem #599 — The Erdős–Menger Conjecture
Statement
Let be a possibly infinite simple graph on a vertex set , and let be disjoint independent sets. Must there exist an index type , vertices and for each , paths in from to , and a set such that: the paths are pairwise vertex-disjoint; each is a path; is contained in the union of the vertex supports of the paths; contains exactly one vertex from each ; and every path from a vertex of to a vertex of contains at least one vertex of ?
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.