The minimum-edge non-TRVG conjecture for K_3,5
Statement
Let a transparent rectangle visibility graph (TRVG) be a graph admitting a representation by axis-parallel rectangles in which two vertices are adjacent when their rectangles are visible to one another, and call a graph that has no such representation a non-TRVG. The complete bipartite graph has edges.
Minimum-edge non-TRVG conjecture. is a non-TRVG with the least number of edges.
The paper establishes that is a non-TRVG and reports that no non-TRVG with fewer than edges was found; the conjectured minimality remains 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.