ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K3k+4K_{3k+4} denote the complete graph on 3k+43k+4 vertices, and let a semi-arc kk-visibility graph be a graph represented by semi-arcs with visibility determined by at most kk blockers. Complete-graph non-realizability conjecture. The complete graph K3k+4K_{3k+4} is not a semi-arc kk-visibility graph.

This conjecture is presented as a consequence of the preceding maximum-edge conjecture: applying that bound at n=3k+4n=3k+4 would give fewer than the (3k+42)\binom{3k+4}{2} edges of the complete graph. It remains open in the supplied source.

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.