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
if n is odd then there exist isometric embeddings of \frac{1}{2}H_{n} in the half-spin Grassmann graphs of \Pi whose images are not apartments.