Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
1 problem
showing 1–1
We believe that results similar to Theorem 4.3.5 can be proved for intersection graphs of other scalable objects. In particular, we conjecture that similar techniques apply to intersection graphs of (unit) regular hexagons.