The asymptotic existence conjecture for irreducible non-metrizable path systems
Statement
Let be the Erdős–Rényi random graph on vertices, with each edge present independently with probability . An irreducible non-metrizable path system is a path system that is both irreducible and non-metrizable.
Asymptotic existence conjecture. Asymptotically almost every graph has an irreducible non-metrizable path system; specifically, this holds with probability
for graphs.
This conjecture asks whether the explicit constructions of irreducible non-metrizable path systems extend to almost all large random graphs. The source presents it as an open problem, and no resolution is supplied here.
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.