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.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No closed issues
Issues hold questions, sub-problems and requests for help.