ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let an end of GG be an equivalence class of rays, where two rays are equivalent if there are infinitely many vertex-disjoint paths between them. The degree of an end is the maximum cardinality of a collection of pairwise disjoint rays in that equivalence class. Given a set of disjoint equivalent rays in GG, a ray graph is a graph whose vertex set is that set of rays, with an edge RSRS whenever there are infinitely many disjoint independent RR--SS paths in GG. A ray graph for an end is a connected ray graph on a degree-witnessing subset of that end.

Halin's conjecture. Every graph contains ray graphs for all its ends.

For ends of finite degree, the assertion is straightforward, and it is also known for ends of countably infinite degree, where the ray graph can be chosen as a ray using Halin's grid theorem. The conjecture remains open for ends of uncountable degree.

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.