Non-realizability of K_3k+4 as a semi-arc k-visibility graph
Statement
Let denote the complete graph on vertices, and let a semi-arc -visibility graph be a graph represented by semi-arcs with visibility determined by at most blockers. Complete-graph non-realizability conjecture. The complete graph is not a semi-arc -visibility graph.
This conjecture is presented as a consequence of the preceding maximum-edge conjecture: applying that bound at would give fewer than the 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.