Suppose G is a connected, simple, planar graph with 100 vertices. What is the largest possible number of edges in G?

Answer 1

Euler's formula: e ≤ 3v − 6 if v ≥ 3

Thus, for v=100, e ≤ 294