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.
Pull requests
Pull requests bring work from one route into another; merging one adopts it.
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.
Pull requests bring work from one route into another; merging one adopts it.