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.
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.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.