ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(A⊎B,E)G=(A\uplus B,E) be a bipartite linklessly embeddable graph, and let << be a (3,3)(3,3)-admissible order. Write GbG^b for the balanced shift of GG. Bipartite linkless-embeddability conjecture. If ∣A∣,∣B∣≥4|A|,|B|\geq 4, then K4,4−K_{4,4}^- is not a subgraph of GbG^b, and consequently

E≤3∣V(G)∣−10.E\leq 3|V(G)|-10.

In particular, all bipartite linklessly embeddable graphs are (3,3)(3,3)-stress free; hence, if AA and BB each have size at least 33,

E≤3∣V(G)∣−9.E\leq 3|V(G)|-9.

This is motivated by the non-linkless embeddability of K4,4K_{4,4} minus an edge. The source explicitly states that even the inequality E≤3∣V(G)∣−9E\leq 3|V(G)|-9 is open.

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.