The non-TRVG conjecture for DnaD^a_n in the remaining range

From papers

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+5n2a+7anda3.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+5n2a+72a+5\le n\le 2a+7 and a3a\ge 3.

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

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Chaipattana Juntarapomdach and Teeradej Kittipassorn, “Transparent Rectangle Visibility Graphs”, arXiv:2506.14522 (2025).

Solutions 0

No solutions have been posted yet.