ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 22-connected non-planar graph contained in a closed surface FF. For a pair (F,G)(F,G), define its representativity by

r(F,G)=min⁡C∈CF∣C∩G∣,r(F,G)=\min_{C\in \mathcal{C}_F}|C\cap G|,

where CF\mathcal{C}_F is the set of all essential loops embedded in FF. Define

r(G)=max⁡F∈Fr(F,G),r(G)=\max_{F\in\mathcal{F}}r(F,G),

where F\mathcal{F} is the set of all closed surfaces containing GG. Strong embedding conjecture. It holds that

r(G)≥2.r(G)\ge 2.

This is attributed in the source to Robertson and Vitray. The excerpt gives no evidence that the conjecture has been resolved.

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.