Infinite Gallai–Milgram conjecture
Statement
Let be a digraph without infinite directed paths. Infinite Gallai–Milgram conjecture. There is a vertex-partition of into directed paths and an independent set of vertices such that meets every 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.