The non-TRVG conjecture for in the remaining range
Let denote the graph used in the paper, with parameters and . A non-TRVG is a graph that is not a transparent rectangle visibility graph. The conjecture concerns integers satisfying
The non-TRVG conjecture. is a non-TRVG when and .
The paper proves that is a non-TRVG for and a TRVG for , leaving this intermediate range as the stated conjecture.
References
Primary source
Chaipattana Juntarapomdach and Teeradej Kittipassorn, “Transparent Rectangle Visibility Graphs”, arXiv:2506.14522 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.