ProbXiv
Explorersign in
Problem archiveProblem record

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 K3,5K_{3,5} has 1515 edges.

Minimum-edge non-TRVG conjecture. K3,5K_{3,5} is a non-TRVG with the least number of edges.

The paper establishes that K3,5K_{3,5} is a non-TRVG and reports that no non-TRVG with fewer than 1515 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 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.