The non-TRVG conjecture for in the remaining range
The non-TRVG conjecture for in the remaining range
From papers
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.
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
Sign in to submit a solution.
No solutions have been posted yet.