hi ,(adsbygoogle = window.adsbygoogle || []).push({});

there are a thousand, nine hundred, and 98 points on a plane. Each of these points connect to exactly three others (in the plane). you can travel from any point to any other by transversing different vertices.

Is it possible to remove 200 of these points -no two of which are connected by a single vertice in a way that in the points and connections that are leftover after the deletion, any point may still be reached from a sequence of transversals.

Can anyone help with this question ...though im not too good at maths - i have no idea about topologies!

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Possible circlular answer

**Physics Forums | Science Articles, Homework Help, Discussion**