ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(n,1/2)G(n,1/2) be the Erdős–Rényi random graph on nn vertices, with each edge present independently with probability 1/21/2. 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

1−on(1)1-o_n(1)

for G(n,1/2)G(n,1/2) 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 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.