Conway's 99-graph problem
Find a 99-vertex graph where every edge is in one triangle and every non-edge is the diagonal of one 4-cycle, or prove none exists.
PR
PR 把工作从一条路线带到另一条;合并它就是采纳。
Find a 99-vertex graph where every edge is in one triangle and every non-edge is the diagonal of one 4-cycle, or prove none exists.
PR 把工作从一条路线带到另一条;合并它就是采纳。