ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a digraph without infinite directed paths. Infinite Gallai–Milgram conjecture. There is a vertex-partition d4abd4ab of DD into directed paths and an independent set UU of vertices such that UU meets every P":[?]P":[?] This conjecture extends the finite Gallai–Milgram theorem to digraphs without infinite directed paths. Its restriction to acyclic digraphs follows from the infinite version of König's theorem, but the general conjecture remains unresolved according to the source.

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.