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
It is natural to conjecture that ker(f^*)=Z_d+2^2⊕ Z_d(d+2)^β(G)-2 holds for non-bipartite graphs in general.