ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a possibly infinite simple graph on a vertex set VV, and let A,B⊆VA,B\subseteq V be disjoint independent sets. Must there exist an index type ι\iota, vertices ai∈Aa_i\in A and bi∈Bb_i\in B for each i∈ιi\in\iota, paths PiP_i in GG from aia_i to bib_i, and a set S⊆VS\subseteq V such that: the paths PiP_i are pairwise vertex-disjoint; each PiP_i is a path; SS is contained in the union of the vertex supports of the paths; SS contains exactly one vertex from each PiP_i; and every path from a vertex of AA to a vertex of BB contains at least one vertex of SS?

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.