ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DnaD^a_n denote the graph used in the paper, with parameters aa and nn. A non-TRVG is a graph that is not a transparent rectangle visibility graph. The conjecture concerns integers satisfying

2a+5≤n≤2a+7anda≥3.2a+5\le n\le 2a+7\quad\text{and}\quad a\ge 3.

The DnaD^a_n non-TRVG conjecture. DnaD^a_n is a non-TRVG when 2a+5≤n≤2a+72a+5\le n\le 2a+7 and a≥3a\ge 3.

The paper proves that DnaD^a_n is a non-TRVG for n≥2a+8n\ge 2a+8 and a TRVG for n≤2a+4n\le 2a+4, leaving this intermediate range as the stated conjecture.

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.